The Flag-based Algorithm - A Novel Greedy Method that Optimizes Protein Communities Detection
Keywords:Interactome networks, protein-protein interactions, protein communities, cancer, greedy algorithm
AbstractProteins and the networks they determine, called interactome networks, have received attention at an important degree during the last years, because they have been discovered to have an influence on some complex biological phenomena, such as problematic disorders like cancer. This paper presents a contribution that aims to optimize the detection of protein communities through a greedy algorithm that is implemented in the C programming language. The optimization involves a double improvement in relation to protein communities detection, which is accomplished both at the algorithmic and programming level. The resulting implementation’s performance was carefully tested on real biological data and the results acknowledge the relevant speedup that the optimization determines. Moreover, the results are in line with the previous findings that our current research produced, as it reveals and confirms the existence of some important properties of those proteins that participate in the carcinogenesis process. Apart from being particularly useful for research purposes, the novel community detection algorithm also dramatically speeds up the proteomic databases analysis process, as compared to some other sequential community detection approaches, and also to the sequential algorithm of Newman and Girvan.
J. Yoon, A. Blumer and K. Lee, An algorithm for modularity analysis of directed and weighted biological networks based on edge-betweenness centrality: Bioinformatics, 2006. http://dx.doi.org/10.1093/bioinformatics/btl533
M. Girvan and M.E.J. Newman, Community structure in social and biological networks: State University of New Jersey, 2002.
D. Ucar et al., Improving functional modularity in protein-protein interactions graphs using hub-induced subgraphs: Ohio State University, 2007.
K. Lehmann and M. Kaufmann, Decentralized algorithms for evaluating centrality in complex networks: IEEE, 2002.
J. Griebsch et al., A fast algorithm for the iterative calculation of betweenness centrality: Technical University of Munchen, 2004.
G.H. Traver et al., How complete are current yeast and human protein-interaction networks? : Genome biology, 2006.
R. Bunescu et al., Consolidating the set of known human protein-protein interactions in preparation for large-scale mapping of the human interactome: Genome biology, 2005.
U. Brandes, A faster algorithm for betweenness centrality: University of Konstanz, 2001.
B. Preiss, Data structures and algorithms with object-oriented design patterns in C++: John Wiley and sons, 1998.
EMBL-EBI, The IntAct protein interactions database. URL: http://www.ebi.ac.uk/intact/site/index.jsf, 2009.
A. Grama et al., Introduction to parallel computing, second edition: Addison-Wesley, 2003.
University of California, The DIP protein interactions database. URL: http://dip.doembi. ucla.edu/, 2009.
R. Bocu and S. Tabirca, Betweenness Centrality Computation - A New Way for Analyzing the Biological Systems: Proceedings of the BSB 2009 conference, Leipzig, Germany, 2009.
L.C. Freeman, A set of measures of centrality based on betweenness: Sociometry, Vol. 40, 35-41, 1977. http://dx.doi.org/10.2307/3033543
P.F. Jonsson and P.A. Bates, Global topological features of cancer proteins in the human interactome: Bioinformatics Advance Access, 2006.
Wellcome Trust Sanger Institute, The Pfam protein families database. URL: http://pfam.sanger.ac.uk/, 2009.
R. Bocu and S. Tabirca, Sparse networks-based speedup technique for proteins betweenness centrality computation: International Journal of Biological and Life Sciences, 2009.
S. Wachi et al., Interactome-transcriptome analysis reveals the high centrality of genes differentially expressed in lung cancer tissues: Bioinformatics, 21, 4205-4208, 2005. http://dx.doi.org/10.1093/bioinformatics/bti688
G. Palla et al., Uncovering the overlapping community structure of complex networks in nature and society: Nature, 435, 814-818, 2005. http://dx.doi.org/10.1038/nature03607
P.F. Jonsson et al., Cluster analysis of networks generated through homology: automatic identification of important protein communities involved in cancer metastasis: BMC Bioinformatics, 7, 2, 2006. http://dx.doi.org/10.1186/1471-2105-7-2
R. Bocu and S. Tabirca, Proteomic Data Analysis Optimization Using a Parallel MPI C Approach: IEEE Computer Society, The First International Conference on Advances in Bioinformatics and Applications, 2010. http://dx.doi.org/10.1109/biosciencesworld.2010.11
A. Clauset, M.E.J. Newman and Ch. Moore, Finding community structure in very large networks: Phys. Rev. E 70, 066111, 2004. http://dx.doi.org/10.1103/PhysRevE.70.066111
S. Schnell, S. Fortunato and R. Sourav, Is the intrinsic disorder of proteins the cause of the scale-free architecture of protein-protein interaction networks? : Proteomics 7 no. 6, 961-964, 2007. http://dx.doi.org/10.1002/pmic.200600455
V. Batagelj and U. Brandes, Efficient generation of large random networks: Physical Review E. 71:036113-036118, 2005. http://dx.doi.org/10.1103/PhysRevE.71.036113
R. Bocu, Detecting community structure in networks: Eur. Phys. J. B 38, 321-330, 2004. http://dx.doi.org/10.1140/epjb/e2004-00124-y
V.D. Blondel, J.-L. Guillaume, R. Lambiotte and E. Lefebvre, Fast unfolding of communities in large networks: Journal of Statistical Mechanics, arXiv:0803.0476v2 [physics.soc-ph], 2008.
ONLINE OPEN ACCES: Acces to full text of each article and each issue are allowed for free in respect of Attribution-NonCommercial 4.0 International (CC BY-NC 4.0.
You are free to:
-Share: copy and redistribute the material in any medium or format;
-Adapt: remix, transform, and build upon the material.
The licensor cannot revoke these freedoms as long as you follow the license terms.
DISCLAIMER: The author(s) of each article appearing in International Journal of Computers Communications & Control is/are solely responsible for the content thereof; the publication of an article shall not constitute or be deemed to constitute any representation by the Editors or Agora University Press that the data presented therein are original, correct or sufficient to support the conclusions reached or that the experiment design or methodology is adequate.