Identify protein complexes based on PageRank algorithm and architecture on dynamic PPI networks Online publication date: Mon, 05-Aug-2019
by Xiujuan Lei; Jing Liang; Ling Guo
International Journal of Data Mining and Bioinformatics (IJDMB), Vol. 22, No. 4, 2019
Abstract: Protein-Protein Interactions (PPI) are dynamic in cellular organisation. Protein complexes play significant roles in cells. Thus, detecting protein complexes from dynamic PPI networks is realistic. In this paper, we proposed a novel protein complexes prediction algorithm based on core-attachment structure and Pagerank algorithm (PRCA), which run in dynamic PPI networks. This method is divided into three steps. Firstly, calculating the weight value of every protein in dynamic PPI networks to obtain seed proteins. Second, considering triangular structures, cores of protein complexes are acquired. Third, calculating the PageRank value of the adjacent proteins of protein complexes, attachments of protein complexes are appended to their corresponding cores to form protein complexes. This method identifies protein complexes in dynamic PPI networks of DIP, MIPS and Krogan dataset. The experimental results show that PRCA algorithm outperforms other algorithms in precision, recall, f-measure and p-value.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Data Mining and Bioinformatics (IJDMB):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook