Abstract—Since standard biclustering problem was defined, the problem is known to be NP-hard. However in analyzing time series expression data, we can restrict the problem with the trait of data that represented the contiguous columns, which corresponded to coherent expression patterns. With this restriction included, the problem considered to be tractable problem. We propose an algorithm to find and report all maximal contiguous column coherent biclusters with the shifting input included in time linear within the size of expression matrix multiplied by the size of the shifting window.

Index Terms—Biclustering, regulatory modules, shifting input data, suffix tree, time series gene expression data.

Tustanah Phukhachee and Songrit Maneewongvatana are with the Computer Engineering Department, Faculty of Engineering, King Mongkut‟s University of Technology Thonburi, Bangkok, Thailand (e-mail: s54450015@st.kmutt.ac.th, songrit@cpe.kmutt.ac.th).

 

Cite:Tustanah Phukhachee and Songrit Maneewongvatana, "Identification of Shifting Regulatory Modules in Time Series Gene Expression Data Using a Linear Time Biclustering Algorithm," International Journal of Bioscience, Biochemistry and Bioinformatics vol. 3, no. 3, pp. 221-225, 2013.