Journal
JOURNAL OF COMPUTATIONAL BIOLOGY
Volume 20, Issue 4, Pages 344-358Publisher
MARY ANN LIEBERT, INC
DOI: 10.1089/cmb.2012.0273
Keywords
algorithms; biochemical networks; gene clusters; gene expression; learning; machine learning; mass spectroscopy
Categories
Funding
- Div Of Information & Intelligent Systems
- Direct For Computer & Info Scie & Enginr [1117965] Funding Source: National Science Foundation
Ask authors/readers for more resources
Protein interactions are central to all the biological processes and structural scaffolds in living organisms, because they orchestrate a number of cellular processes such as metabolic pathways and immunological recognition. Several high-throughput methods, for example, yeast two-hybrid system and mass spectrometry method, can help determine protein interactions, which, however, suffer from high false-positive rates. Moreover, many protein interactions predicted by one method are not supported by another. Therefore, computational methods are necessary and crucial to complete the interactome expeditiously. In this work, we formulate the problem of predicting protein interactions from a new mathematical perspective-sparse matrix completion, and propose a novel nonnegative matrix factorization (NMF)-based matrix completion approach to predict new protein interactions from existing protein interaction networks. Through using manifold regularization, we further develop our method to integrate different biological data sources, such as protein sequences, gene expressions, protein structure information, etc. Extensive experimental results on four species, Saccharomyces cerevisiae, Drosophila melanogaster, Homo sapiens, and Caenorhabditis elegans, have shown that our new methods outperform related state-of-the-art protein interaction prediction methods.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available