This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Algorithms to Detect Multiprotein Modularity Conserved during Evolution
July-Aug. 2012 (vol. 9 no. 4)
pp. 1046-1058
R. M. Karp, Div. of Comput. Sci., Univ. of California, Berkeley, CA, USA
L. Hodgkinson, Div. of Comput. Sci., Univ. of California, Berkeley, CA, USA
Detecting essential multiprotein modules that change infrequently during evolution is a challenging algorithmic task that is important for understanding the structure, function, and evolution of the biological cell. In this paper, we define a measure of modularity for interactomes and present a linear-time algorithm, Produles, for detecting multiprotein modularity conserved during evolution that improves on the running time of previous algorithms for related problems and offers desirable theoretical guarantees. We present a biologically motivated graph theoretic set of evaluation measures complementary to previous evaluation measures, demonstrate that Produles exhibits good performance by all measures, and describe certain recurrent anomalies in the performance of previous algorithms that are not detected by previous measures. Consideration of the newly defined measures and algorithm performance on these measures leads to useful insights on the nature of interactomics data and the goals of previous and current algorithms. Through randomization experiments, we demonstrate that conserved modularity is a defining characteristic of interactomes. Computational experiments on current experimentally derived interactomes for Homo sapiens and Drosophila melanogaster, combining results across algorithms, show that nearly 10 percent of current interactome proteins participate in multiprotein modules with good evidence in the protein interaction data of being conserved between human and Drosophila.

[1] M. Vidal, "Interactome Modeling," FEBS Letters, vol. 579, pp. 1834-1838, 2005.
[2] B.P. Kelley, R. Sharan, R.M. Karp, T. Sittler, D.E. Root, B.R. Stockwell, and T. Ideker, "Conserved Pathways within Bacteria and Yeast as Revealed by Global Protein Network Alignment," Proc. Nat'l Academy of Sciences USA, vol. 100, no. 20, pp. 11394-11399, 2003.
[3] R. Sharan, S. Suthram, R.M. Kelley, T. Kuhn, S. McCuine, P. Uetz, T. Sittler, R.M. Karp, and T. Ideker, "Conserved Patterns of Protein Interaction in Multiple Species," Proc. Nat'l Academy of Sciences USA, vol. 102, no. 6, pp. 1947-1979, 2005.
[4] M. Koyutürk, Y. Kim, U. Topkara, S. Subramaniam, W. Szpankowski, and A. Grama, "Pairwise Alignment of Protein Interaction Networks," J. Computational Biology, vol. 13, no. 2, pp. 182-199, 2006.
[5] J. Flannick, A. Novak, B.S. Srinivasan, H.H. McAdams, and S. Batzoglou, "Graemlin: General and Robust Alignment of Multiple Large Interaction Networks," Genome Research, vol. 16, pp. 1169-1181, 2006.
[6] M. Narayanan and R.M. Karp, "Comparing Protein Interaction Networks via a Graph Match-and-Split Algorithm," J. Computational Biology, vol. 14, no. 7, pp. 892-907, 2007.
[7] Modularity: Understanding the Development and Evolution of Natural Complex Systems, Vienna Series in Theoretical Biology, W. Callebaut and D. Rasskin-Gutman, eds. MIT Press, 2005.
[8] P. Beltrao and L. Serrano, "Specificity and Evolvability in Eukaryotic Protein Interaction Networks," PLoS Computational Biology, vol. 3, no. 2,article e25, 2007.
[9] S.F. Altschul, W. Gish, W. Miller, E.W. Myers, and D.J. Lipman, "Basic Local Alignment Search Tool," J. Molecular Biology, vol. 215, no. 3, pp. 403-410, 1990.
[10] H.A. Simon, "The Structure of Complexity in an Evolving World: The Role of Near Decomposability," Modularity: Understanding the Development and Evolution of Natural Complex Systems, Vienna Series in Theoretical Biology, W. Callebaut and D. Rasskin-Gutman, eds., pp. ix-xiii, MIT Press, 2005.
[11] J. Wang, M. Li, J. Chen, and Y. Pan, "A Fast Hierarchical Clustering Algorithm for Functional Modules Discovery in Protein Interaction Networks," IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 8, no. 3, pp. 607-620, May/June 2011.
[12] R. Andersen, F. Chung, and K. Lang, "Using PageRank to Locally Partition a Graph," Internet Math., vol. 4, no. 1, pp. 35-64, 2007.
[13] D.A. Spielman and S. Teng, "A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly-Linear Time Graph Partitioning," CoRR, article abs/0809.3232, 2008.
[14] K. Voevodski, S. Teng, and Y. Xia, "Finding Local Communities in Protein Networks," BMC Bioinformatics, vol. 10, article 297, 2009.
[15] M. Blum, R.W. Floyd, V. Pratt, R.L. Rivest, and R.E. Tarjan, "Time Bounds for Selection," J. Computer and System Sciences, vol. 7, no. 4, pp. 448-461, 1973.
[16] J. Hopcroft and R. Tarjan, "Efficient Algorithms for Graph Manipulation," Comm. ACM, vol. 16, no. 6, pp. 372-378, 1973.
[17] Gene Ontology Consortium, "The Gene Ontology in 2010: Extensions and Refinements," Nucleic Acids Research, vol. 38, Database Issue, pp. D331-D335, Jan. 2010.
[18] M. Kalaev, V. Bafna, and R. Sharan, "Fast and Accurate Alignment of Multiple Protein Networks," J. Computational Biology, vol. 16, no. 8, pp. 989-999, 2009.
[19] S. Razick, G. Magklaras, and I.M. Donaldson, "iRefIndex: A Consolidated Protein Interaction Database with Provenance," BMC Bioinformatics, vol. 9, article 405, 2008.
[20] J. Flannick, A. Novak, C.B. Do, B.S. Srinivasan, and S. Batzoglou, "Automatic Parameter Learning for Multiple Network Alignment," J. Computational Biology, vol. 16, no. 8, pp. 1001-1022, 2009.
[21] S. Bauer, S. Grossmann, M. Vingron, and P.N. Robinson, "Ontologizer 2.0—A Multifunctional Tool for GO Term Enrichment Analysis and Data Exploration," Bioinformatics, vol. 24, no. 14, pp. 1650-1651, 2008.
[22] A. Lunardi et al., "A Genome-Scale Protein Interaction Profile of Drosophila p53 Uncovers Additional Nodes of the Human p53 Network," Proc. Nat'l Academy of Sciences USA, vol. 107, no. 14, pp. 6322-6327, Apr. 2010.
[23] L. Giot et al., "A Protein Interaction Map of Drosophila Melanogaster," Science, vol. 302, pp. 1727-1736, 2003.
[24] L. Hodgkinson and R.M. Karp, "Algorithms to Detect Multi-Protein Modularity Conserved during Evolution," Technical Report UCB/EECS-2011-7, EECS Dept., Univ. of California, Berkeley, 2011.
[25] L. Hodgkinson and R.M. Karp, "Algorithms to Detect Multiprotein Modularity Conserved during Evolution," Proc. Int'l Symp. Bioinformatics Research and Applications (ISBRA '11), pp. 111-122, 2011.

Index Terms:
graph theory,biology,evolutionary computation,interactomics data,multiprotein modularity conserved detection,essential multiprotein module detection,biological cell,linear time algorithm,multiprotein modularity,graph theoretic set,Proteins,Evolution (biology),Organisms,Current measurement,Computational biology,Radiation detectors,Bioinformatics,algorithms.,Modularity,interactomes,evolution
Citation:
R. M. Karp, L. Hodgkinson, "Algorithms to Detect Multiprotein Modularity Conserved during Evolution," IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 9, no. 4, pp. 1046-1058, July-Aug. 2012, doi:10.1109/TCBB.2011.125
Usage of this product signifies your acceptance of the Terms of Use.