A polynomial time biclustering algorithm for finding approximate expression patterns in gene expression time series |
| |
Authors: | Sara C Madeira Arlindo L Oliveira |
| |
Affiliation: | 1. Knowledge Discovery and Bioinformatics (KDBIO) group, INESC-ID, Lisbon, Portugal 2. Instituto Superior Técnico, Technical University of Lisbon, Lisbon, Portugal 3. University of Beira Interior, Covilh?, Portugal
|
| |
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 the interesting biclusters can be restricted to those with contiguous columns. This restriction leads to a tractable problem and enables the design of efficient biclustering algorithms able to identify all maximal contiguous column coherent biclusters. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|