Computational Prediction of Protein Complexes from Protein Interaction Networks

Nonfiction, Science & Nature, Science, Biological Sciences, Cytology, Biology, Computers
Cover of the book Computational Prediction of Protein Complexes from Protein Interaction Networks by Sriganesh Srihari, Chern Han Yong, Limsoon Wong, M. Tamer Ozsu, Association for Computing Machinery and Morgan & Claypool Publishers
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Sriganesh Srihari, Chern Han Yong, Limsoon Wong, M. Tamer Ozsu ISBN: 9781970001549
Publisher: Association for Computing Machinery and Morgan & Claypool Publishers Publication: May 30, 2017
Imprint: ACM Books Language: English
Author: Sriganesh Srihari, Chern Han Yong, Limsoon Wong, M. Tamer Ozsu
ISBN: 9781970001549
Publisher: Association for Computing Machinery and Morgan & Claypool Publishers
Publication: May 30, 2017
Imprint: ACM Books
Language: English

Complexes of physically interacting proteins constitute fundamental functional units that drive almost all biological processes within cells. A faithful reconstruction of the entire set of protein complexes (the "complexosome") is therefore important not only to understand the composition of complexes but also the higher level functional organization within cells. Advances over the last several years, particularly through the use of high-throughput proteomics techniques, have made it possible to map substantial fractions of protein interactions (the "interactomes") from model organisms including Arabidopsis thaliana (a flowering plant), Caenorhabditis elegans (a nematode), Drosophila melanogaster (fruit fly), and Saccharomyces cerevisiae (budding yeast). These interaction datasets have enabled systematic inquiry into the identification and study of protein complexes from organisms. Computational methods have played a significant role in this context, by contributing accurate, efficient, and exhaustive ways to analyze the enormous amounts of data. These methods have helped to compensate for some of the limitations in experimental datasets including the presence of biological and technical noise and the relative paucity of credible interactions.

In this book, we systematically walk through computational methods devised to date (approximately between 2000 and 2016) for identifying protein complexes from the network of protein interactions (the protein-protein interaction (PPI) network). We present a detailed taxonomy of these methods, and comprehensively evaluate them for protein complex identification across a variety of scenarios including the absence of many true interactions and the presence of false-positive interactions (noise) in PPI networks. Based on this evaluation, we highlight challenges faced by the methods, for instance in identifying sparse, sub-, or small complexes and in discerning overlapping complexes, and reveal how a combination of strategies is necessary to accurately reconstruct the entire complexosome.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

Complexes of physically interacting proteins constitute fundamental functional units that drive almost all biological processes within cells. A faithful reconstruction of the entire set of protein complexes (the "complexosome") is therefore important not only to understand the composition of complexes but also the higher level functional organization within cells. Advances over the last several years, particularly through the use of high-throughput proteomics techniques, have made it possible to map substantial fractions of protein interactions (the "interactomes") from model organisms including Arabidopsis thaliana (a flowering plant), Caenorhabditis elegans (a nematode), Drosophila melanogaster (fruit fly), and Saccharomyces cerevisiae (budding yeast). These interaction datasets have enabled systematic inquiry into the identification and study of protein complexes from organisms. Computational methods have played a significant role in this context, by contributing accurate, efficient, and exhaustive ways to analyze the enormous amounts of data. These methods have helped to compensate for some of the limitations in experimental datasets including the presence of biological and technical noise and the relative paucity of credible interactions.

In this book, we systematically walk through computational methods devised to date (approximately between 2000 and 2016) for identifying protein complexes from the network of protein interactions (the protein-protein interaction (PPI) network). We present a detailed taxonomy of these methods, and comprehensively evaluate them for protein complex identification across a variety of scenarios including the absence of many true interactions and the presence of false-positive interactions (noise) in PPI networks. Based on this evaluation, we highlight challenges faced by the methods, for instance in identifying sparse, sub-, or small complexes and in discerning overlapping complexes, and reveal how a combination of strategies is necessary to accurately reconstruct the entire complexosome.

More books from Association for Computing Machinery and Morgan & Claypool Publishers

Cover of the book An Architecture for Fast and General Data Processing on Large Clusters by Sriganesh Srihari, Chern Han Yong, Limsoon Wong, M. Tamer Ozsu
Cover of the book Candidate Multilinear Maps by Sriganesh Srihari, Chern Han Yong, Limsoon Wong, M. Tamer Ozsu
Cover of the book The Handbook of Multimodal-Multisensor Interfaces, Volume 1 by Sriganesh Srihari, Chern Han Yong, Limsoon Wong, M. Tamer Ozsu
Cover of the book Edmund Berkeley and the Social Responsibility of Computer Professionals by Sriganesh Srihari, Chern Han Yong, Limsoon Wong, M. Tamer Ozsu
Cover of the book The Handbook of Multimodal-Multisensor Interfaces, Volume 3 by Sriganesh Srihari, Chern Han Yong, Limsoon Wong, M. Tamer Ozsu
Cover of the book A Framework for Scientific Discovery through Video Games by Sriganesh Srihari, Chern Han Yong, Limsoon Wong, M. Tamer Ozsu
Cover of the book Declarative Logic Programming by Sriganesh Srihari, Chern Han Yong, Limsoon Wong, M. Tamer Ozsu
Cover of the book Trust Extension as a Mechanism for Secure Code Execution on Commodity Computers by Sriganesh Srihari, Chern Han Yong, Limsoon Wong, M. Tamer Ozsu
Cover of the book The Sparse Fourier Transform by Sriganesh Srihari, Chern Han Yong, Limsoon Wong, M. Tamer Ozsu
Cover of the book Communities of Computing by Sriganesh Srihari, Chern Han Yong, Limsoon Wong, M. Tamer Ozsu
Cover of the book Verified Functional Programming in Agda by Sriganesh Srihari, Chern Han Yong, Limsoon Wong, M. Tamer Ozsu
Cover of the book Shared-Memory Parallelism Can be Simple, Fast, and Scalable by Sriganesh Srihari, Chern Han Yong, Limsoon Wong, M. Tamer Ozsu
Cover of the book Smarter Than Their Machines by Sriganesh Srihari, Chern Han Yong, Limsoon Wong, M. Tamer Ozsu
Cover of the book Text Data Management and Analysis by Sriganesh Srihari, Chern Han Yong, Limsoon Wong, M. Tamer Ozsu
Cover of the book The VR Book by Sriganesh Srihari, Chern Han Yong, Limsoon Wong, M. Tamer Ozsu
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy