a polynomial time biclustering algorithm for finding approximate expression patterns in gene expression time seriesbiclustering多项式时间算法寻找近似表达式模式基因表达的时间序列.pdfVIP

Algorithms for Molecular Biology BioMed Central Research Open Access A polynomial time biclustering algorithm for finding approximate expression patterns in gene expression time series Sara C Madeira*1,2,3 and Arlindo L Oliveira1,2 Address: 1Knowledge Discovery and Bioinformatics (KDBIO) group, INESC-ID, Lisbon, Portugal, 2Instituto Superior Técnico, Technical University of Lisbon, Lisbon, Portugal and 3University of Beira Interior, Covilhã, Portugal Email: Sara C Madeira* - smadeira@kdbio.inesc-id.pt; Arlindo L Oliveira - aml@inesc-id.pt * Corresponding author Published: 4 June 2009 Received: 14 July 2008 Accepted: 4 June 2009 Algorithms for Molecular Biology 2009, 4:8 doi:10.1186/1748-7188-4-8 This article is available from: /content/4/1/8 © 2009 Madeira and Oliveira; licensee BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract Background: The ability to monitor the change in expression patterns over time, and to observe the emergence of coherent temporal responses using gene expression time series, obtained from microarray experiments, is critical to advance our understanding of complex biological processes. In this context, biclustering algorithms have been recognized as an important tool for the discovery of local expression patterns, which are crucial to unravel potential regulatory mechanisms. Although most formulations of the biclustering problem are NP-hard, when working with time series expression data t