Tuyển tập các báo cáo nghiên cứu về sinh học được đăng trên tạp chí y học Molecular Biology cung cấp cho các bạn kiến thức về ngành sinh học đề tài: A polynomial time biclustering algorithm for finding approximate expression patterns in gene expression time series. | Algorithms for Molecular Biology BioMed Central Research 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 Open Access Address knowledge 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@ Arlindo L Oliveira - aml@ Corresponding author Published 4 June 2009 Received 14 July 2008 Algorithms for Molecular Biology 2009 4 8 doi 1748-7188-4-8 Accepted 4 June 2009 This article is available from http 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 http licenses by 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 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. Methods In this work we propose e-CCC-Biclustering a biclustering algorithm that .
