Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Bar-Joseph, Z.
Right arrow Articles by Rosenfeld, R.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Bar-Joseph, Z.
Right arrow Articles by Rosenfeld, R.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics 20(Suppl. 1) © Oxford University Press 2004; all rights reserved.

Deconvolving cell cycle expression data with complementary information

Ziv Bar-Joseph 1,*, Shlomit Farkash 2, David K. Gifford 3, Itamar Simon 2 and Roni Rosenfeld 1

1 School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, USA, 2 Hebrew University Medical School, Hadassah Ein Kerem, Jerusalem, 91120, Israel and 3 MIT CSAIL, 200 Technology Square, Cambridge, MA 02139, USA

Received on January 15, 2004; accepted on March 1, 2004

Motivation: In the study of many systems, cells are first synchronized so that a large population of cells exhibit similar behavior. While synchronization can usually be achieved for a short duration, after a while cells begin to lose their synchronization. Synchronization loss is a continuous process and so the observed value in a population of cells for a gene at time t is actually a convolution of its values in an interval around t. Deconvolving the observed values from a mixed population will allow us to obtain better models for these systems and to accurately detect the genes that participate in these systems.

Results: We present an algorithm which combines budding index and gene expression data to deconvolve expression profiles. Using the budding index data we first fit a synchronization loss model for the cell cycle system. Our deconvolution algorithm uses this loss model and can also use information from co-expressed genes, making it more robust against noise and missing values. Using expression and budding data for yeast we show that our algorithm is able to reconstruct a more accurate representation when compared with the observed values. In addition, using the deconvolved profiles we are able to correctly identify 15% more cycling genes when compared to a set identified using the observed values.

Availability: Matlab implementation can be downloaded from the supporting website http://www.cs.cmu.edu/~zivbj/decon/decon.html

Contact: zivbj{at}cs.cmu.edu

* To whom correspondence should be addressed.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
Proc. Natl. Acad. Sci. USAHome page
Z. Bar-Joseph, Z. Siegfried, M. Brandeis, B. Brors, Y. Lu, R. Eils, B. D. Dynlacht, and I. Simon
Genome-wide transcriptional analysis of the human cell cycle identifies genes differentially regulated in normal and cancer cells
PNAS, January 22, 2008; 105(3): 955 - 960.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
P. Qiu, Z. J. Wang, and K. J. R. Liu
Polynomial model approach for resynchronization analysis of cell-cycle gene expression data
Bioinformatics, April 15, 2006; 22(8): 959 - 966.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
X. Gan, A. W.-C. Liew, and H. Yan
Microarray missing data imputation based on a set theoretic framework and biological knowledge
Nucleic Acids Res., March 20, 2006; 34(5): 1608 - 1619.
[Abstract] [Full Text] [PDF]



Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.