Identification of K-tolerance regulatory modules in time series gene expression data using a biclustering algorithm

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Nowadays, biclustering problem is still an intractable problem. But in time series expression data, the clusters can be limited those with contiguous columns. This restriction makes biclustering problem to be tractable problem. However existing contiguous column biclustering algorithm can only find the biclusters which have the same value for each column in biclusters without error tolerance. This characteristic leads the algorithm to overlook some patterns in its clustering process. We propose a suffix tree based algorithm that allows biclusters to have inconsistencies in at most k contiguous column. This can reveals previously undiscoverable biclusters. Our algorithm still has tractable run time with this additional feature. © Springer International Publishing 2013.

Cite

CITATION STYLE

APA

Phukhachee, T., & Maneewongvatana, S. (2013). Identification of K-tolerance regulatory modules in time series gene expression data using a biclustering algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8210 LNCS, pp. 146–155). Springer Verlag. https://doi.org/10.1007/978-3-319-02750-0_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free