z-logo
open-access-imgOpen Access
A Novel Algorithm for Detecting Protein Complexes with the Breadth First Search
Author(s) -
Xiwei Tang,
Jianxin Wang,
Min Li,
Yiming He,
Yi Pan
Publication year - 2014
Publication title -
biomed research international
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.772
H-Index - 126
eISSN - 2314-6141
pISSN - 2314-6133
DOI - 10.1155/2014/354539
Subject(s) - false positive paradox , computer science , algorithm , identification (biology) , search algorithm , point (geometry) , data mining , encode , pattern recognition (psychology) , artificial intelligence , computational biology , mathematics , biology , genetics , gene , botany , geometry
Most biological processes are carried out by protein complexes. A substantial number of false positives of the protein-protein interaction (PPI) data can compromise the utility of the datasets for complexes reconstruction. In order to reduce the impact of such discrepancies, a number of data integration and affinity scoring schemes have been devised. The methods encode the reliabilities (confidence) of physical interactions between pairs of proteins. The challenge now is to identify novel and meaningful protein complexes from the weighted PPI network. To address this problem, a novel protein complex mining algorithm ClusterBFS (Cluster with Breadth-First Search) is proposed. Based on the weighted density, ClusterBFS detects protein complexes of the weighted network by the breadth first search algorithm, which originates from a given seed protein used as starting-point. The experimental results show that ClusterBFS performs significantly better than the other computational approaches in terms of the identification of protein complexes.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom