A linear time biclustering algorithm for time series gene expression data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3692 LNBI, Issue , 2005, Pages 39-52

  Madeira, Sara C ^a,b,c   Oliveira, Arlindo L ^a,b  

^a INESC ID   (Portugal)

^b UNIVERSITY OF LISBON   (Portugal)

^c UNIVERSITY OF BEIRA INTERIOR   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

ARRAYS; DATA REDUCTION; HEURISTIC METHODS; PROBLEM SOLVING; PROCESSING;

DATA MATRIX; GENE EXPRESSION DATA; LINEAR TIME BICLUSTERING ALGORITHM; MICROARRAY EXPERIMENTS;

GENETIC ALGORITHMS;

EID: 33646191891     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11557067_4     Document Type: Conference Paper

References (18)

1. A. Ben-Dor, B. Chor, R. Karp, and Z. Yakhini. Discovering local structure in gene expression data: The order-preserving subrnatrix problem. In Proc. of the 6th International Conference on Computational Biology, pages 49-57, 2002.
2. Y. Cheng and G. M. Church. Biclustering of expression data. In Proc. of the 8th International Conference on Intelligent Systems for Molecular Biology, pages 93-103, 2000.
3. D. Gusfield. Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge University Press, 1997.
4. L. Ji and K. Tan. Identifying time-lagged gene clusters using gene expression data. Bioinformatics, 21(4):509-516, 2005.
5. M. Koyuturk, W. Szpankowski, and Ananth Grama. Biclustering gene-feature matrices for statistically significant dense patterns. In Proc. of the 8th Annual International Conference on Research in Computational Molecular Biology, pages 480-484, 2004.
6. J. Liu, W. Wang, and J. Yang. Biclustering in gene expression data by tendency. In Proc. of the 3rd International IEEE Computer Society Computational Systems Bioinformatics Conference, pages 182-193, 2004.
7. S. Lonardi, W. Szpankowski, and Q. Yang. Finding biclusters by random projections. In Proc. of the 15th Annual Symposium on Combinatorial Pattern Matching, Springer, pages 102-116, 2004.
8. Y. Luan and H. Li. Clustering of time-course gene expression data using a mixed-effects model with b-splines. Bioinformatics, 19(4):474-482, 2003.
9. S. C. Madeira and A. L. Oliveira. Biclustering algorithms for biological data analysis: a survey. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 1(1):24-45, Jan-Mar 2004.
10. D. Martin, C. Brun, E. Remy, P. Mouren, D. Thieffry, and B. Jacq. Gotoolbox: functional investigation of gene datasets based on gene ontology. Genome Biology, 5(12):R101, 2004.
11. G. McLachlan, K. Do, and C. Ambroise. Analysing microarray gene expression data. Wiley, 2004.
12. P. Monteiro, M. C. Teixeira, P. Jain, S. Tenreiro, A. R. Fernandes, N. Mira, M. Alenquer, A. T. Freitas, A. L. Oliveira, and Isabel Sá-Correia. Yeast search for transcriptional regulators and consensus tracking (yeastract). http://www.yeastract.com, 2005.
13. T. M. Murali and S. Kasif. Extracting conserved gene expression motifs from gene expression data. In Proc. of the Pacific Symposium on Biocomputing, volume 8, pages 77-88, 2003.
14. R. Peeters. The maximum edge biclique problem is NP-complete. Discrete Applied Mathematics, 131(3):651-654, 2003.
15. Q. Sheng, Y. Moreau, and B. De Moor. Biclustering microarray data by Gibbs sampling. In Bioinformatics, volume 19 (Suppl. 2), pages 196-205, 2003.
16. A. Tanay, R. Sharan, and R. Shamir. Discovering statistically significant biclusters in gene expression data. In Bioinformatics, volume 18 (Suppl. 1), pages S136-S144, 2002.
17. S. Tavazoie, J. D. Hughes, M. J. Campbell, R. J. Cho, and G. M. Church. Systematic determination of genetic network architecture. Nature Genetics, 22:281-285, 1999.
18. E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14:249-260, 1995.