Accurate and Scalable Techniques for the Complex/Pathway Membership Problem in Protein Networks. (12th January 2009)

• Record Type: Journal Article
• Authors: Çamoğlu, Orhan; Can, Tolga; Singh, Ambuj K.
• Other Names: Kahveci Tamer Academic Editor.
• Is Part Of: Advances in bioinformatics. Volume 2009(2009)
• Publication Date: 2009-01-12
• Subjects: Bioinformatics -- Periodicals; Bioinformatics; Computational Biology -- Periodicals; Periodicals; 570.285
• DOI: 10.1155/2009/787128
• Languages: English
• ISSNs: 1687-8027

Abstract

Abstract : A protein network shows physical interactions as well as functional associations. An important usage of such networks is to discover unknown members of partially known complexes and pathways. A number of methods exist for such analyses, and they can be divided into two main categories based on their treatment of highly connected proteins. In this paper, we show that methods that are not affected by the degree (number of linkages) of a protein give more accurate predictions for certain complexes and pathways. We propose a network flow-based technique to compute the association probability of a pair of proteins. We extend the proposed technique using hierarchical clustering in order to scale well with the size of proteome. We also show that top-k queries are not suitable for a large number of cases, and threshold queries are more meaningful in these cases. Network flow technique with clustering is able to optimize meaningful threshold queries and answer them with high efficiency compared to a similar method that uses Monte Carlo simulation.