Skip Navigation


Bioinformatics Advance Access originally published online on February 10, 2004
This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
Right arrow All Versions of this Article:
20/8/1205    most recent
bth061v1
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
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 ISI Web of Science
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 arrow Search for citing articles in:
ISI Web of Science (13)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Iossifov, I.
Right arrow Articles by Rzhetsky, A.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Iossifov, I.
Right arrow Articles by Rzhetsky, A.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

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

Probabilistic inference of molecular networks from noisy data sources

Ivan Iossifov 1,2,*, Michael Krauthammer 1,2, Carol Friedman 1, Vasileios Hatzivassiloglou 3, Joel S. Bader 5, Kevin P. White 4 and Andrey Rzhetsky 1,2

1 Department of Medical Informatics, 2 Columbia Genome Center, Columbia University, New York, NY 10032, USA, 3 Department of Computer Science, Columbia University, New York, NY 10027, USA, 4 Department of Genetics, Yale University School of Medicine, New Haven, CT 06520, USA and 5 CuraGen Corporation, New Haven, CT 06511, USA

Received on July 29, 2003; accepted on September 3, 2003
Advance Access Publication February 10, 2004

Summary: Information on molecular networks, such as networks of interacting proteins, comes from diverse sources that contain remarkable differences in distribution and quantity of errors. Here, we introduce a probabilistic model useful for predicting protein interactions from heterogeneous data sources. The model describes stochastic generation of protein–protein interaction networks with real-world properties, as well as generation of two heterogeneous sources of protein-interaction information: research results automatically extracted from the literature and yeast two-hybrid experiments. Based on the domain composition of proteins, we use the model to predict protein interactions for pairs of proteins for which no experimental data are available. We further explore the prediction limits, given experimental data that cover only part of the underlying protein networks. This approach can be extended naturally to include other types of biological data sources.

Contact: iossifov{at}dbmi.columbia.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
Nucleic Acids ResHome page
C. Prieto and J. De Las Rivas
APID: Agile Protein Interaction DataAnalyzer.
Nucleic Acids Res., July 1, 2006; 34(Web Server issue): W298 - W302.
[Abstract] [Full Text] [PDF]


Home page
J Biomol ScreenHome page
C. N. Parker
McMaster University Data-Mining and Docking Competition: Computational Models on the Catwalk
J Biomol Screen, October 1, 2005; 10(7): 647 - 648.
[PDF]


Home page
BioinformaticsHome page
Y. Liu, N. Liu, and H. Zhao
Inferring protein-protein interactions through high-throughput interaction data from diverse organisms
Bioinformatics, August 1, 2005; 21(15): 3279 - 3285.
[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.