The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - Jan.-Feb. (2013 vol.10)
pp: 109-121
A. Todor , Dept. of Comput. & Inf. Sci. & Eng., Univ. of Florida, Gainesville, FL, USA
A. Dobra , Dept. of Comput. & Inf. Sci. & Eng., Univ. of Florida, Gainesville, FL, USA
T. Kahveci , Dept. of Comput. & Inf. Sci. & Eng., Univ. of Florida, Gainesville, FL, USA
ABSTRACT
Interactions between molecules are probabilistic events. An interaction may or may not happen with some probability, depending on a variety of factors such as the size, abundance, or proximity of the interacting molecules. In this paper, we consider the problem of aligning two biological networks. Unlike existing methods, we allow one of the two networks to contain probabilistic interactions. Allowing interaction probabilities makes the alignment more biologically relevant at the expense of explosive growth in the number of alternative topologies that may arise from different subsets of interactions that take place. We develop a novel method that efficiently and precisely characterizes this massive search space. We represent the topological similarity between pairs of aligned molecules (i.e., proteins) with the help of random variables and compute their expected values. We validate our method showing that, without sacrificing the running time performance, it can produce novel alignments. Our results also demonstrate that our method identifies biologically meaningful mappings under a comprehensive set of criteria used in the literature as well as the statistical coherence measure that we developed to analyze the statistical significance of the similarity of the functions of the aligned protein pairs.
INDEX TERMS
Probabilistic logic, Proteins, Network topology, Polynomials, Random variables, Topology,random graphs, Probabilistic biological networks, network alignment, neighborhood topology
CITATION
A. Todor, A. Dobra, T. Kahveci, "Probabilistic Biological Network Alignment", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.10, no. 1, pp. 109-121, Jan.-Feb. 2013, doi:10.1109/TCBB.2012.142
REFERENCES
[1] S.F. Altschul et al., “Basic Local Alignment Search Tool,” J. Molecular Biology, vol. 215, pp. 403-410, 1990.
[2] F. Ay, T. Kahveci, and V. de Crecy-Lagard, “A Fast and Accurate Algorithm for Comparative Analysis of Metabolic Pathways,” J. Bioinformatics and Computational Biology, vol. 7, pp. 389-428, 2009.
[3] J.S. Bader et al., “Gaining Confidence in High-Throughput Protein Interaction Networks,” Nature Biotechnology, vol. 22, pp. 78-85, 2003.
[4] A. Ceol et al., “MINT, the Molecular INTeraction Database: 2009 Update,” Nucleic Acids Research, vol. 38, pp. D532-D539, 2010.
[5] M. Chen and Hofestadt, “Prediction and Alignment of Metabolic Pathways,” Bioinformatics of Genome Regulation and Structure, pp. 355-265, 2006.
[6] J.C. Clemente, K. Satou, and G. Valiente, “Finding Conserved and Non-Conserved Reactions Using a Metabolic Pathway Alignment Algorithm,” Genome Informatics, vol. 17, pp. 46-56, 2006.
[7] A. Dobra, “Scalable Classification and Regression Tree Construction,” PhD thesis, Cornell Univ., 2003.
[8] C. Francke, R.J. Siezen, and B. Teusink, “Reconstructing the Metabolic Network of a Bacterium from Its Genome,” Trends in Microbiology, vol. 13, pp. 550-558, 2005.
[9] N. Friedman, L. Cai, and X.S. Xie, “Linking Stochastic Dynamics to Population Distribution: An Analytical Framework of Gene Expression,” Phys. Rev. Letters, vol. 97, p. 168302, 2006.
[10] A. Gitter et al., “Discovering Pathways by Orienting Edges in Protein Interaction Networks,” Nucleic Acids Research, 2010.
[11] G.H. Golub and C. van Loan, Matrix Computations. Johns Hopkins Univ. Press, 2006.
[12] M. Green and P. Karp, “A Bayesian Method for Identifying Missing Enzymes in Predicted Metabolic Pathway Databases,” BMC Bioinformatics, vol. 5, p. 76, 2004.
[13] Y. Hu et al., “An Integrative Approach to Ortholog Prediction for Disease-Focused and Other Functional Studies,” BMC Bioinformatics, vol. 12, p. 237, 2011.
[14] M. Kanehisa et al., “The KEGG Resource for Deciphering the Genome,” Nucleic Acids Research, vol. 32, pp. D277-D280, 2004.
[15] B.P. Kelley et al., “Conserved Pathways within Bacteria and Yeast as Revealed by Global Protein Network Alignment,” Proc. Nat'l Academy of Sciences of USA, vol. 100, pp. 11394-11399, 2003.
[16] H.W. Kuhn, “The Hungarian Method for the Assignment Problem,” Naval Research Logistics Quarterly, 1955.
[17] C. Lanczos, “A Precision Approximation of the Gamma Function,” SIAM J. Numerical Analysis Series B, vol. 1, pp. 86-96, 1964.
[18] D.-S. Lee et al., “The Implications of Human Metabolic Network Topology for Disease Comorbidity,” Proc. Nat'l Academy of Sciences of USA, vol. 105, pp. 9880-9885, 2008.
[19] W. Li et al., “Integrative Analysis of Many Weighted Co-Expression Networks Using Tensor Computation,” PLoS Computational Biology, vol. 7, p. e1001106, 2011.
[20] Z. Li et al., “Alignment of Molecular Networks by Integer Quadratic Programming,” Bioinformatics, vol. 23, pp. 1631-1639, 2007.
[21] C. Liao et al., “IsoRankN: Spectral Methods for Global Alignment of Multiple Protein Networks,” Bioinformatics, vol. 25, pp. i253-i258, 2009.
[22] M. Narayanan and R.M. Karp, “Comparing Protein Interaction Networks via a Graph Match-and-Split Algorithm,” J. Computational Biology, vol. 14, pp. 892-907, 2008.
[23] H. Ogata et al., “A Heuristic Graph Comparison Algorithm and Its Application to Detect Functionally Related Enzyme Clusters,” Nucleic Acids Research, vol. 28, pp. 4021-4028, 2000.
[24] O. Ourfali et al., “SPINE: A Framework for Signaling-Regulatory Pathway Inference from Cause-Effect Experiments,” ISMB/ECCB (Supplement of Bioinformatics), vol. 23, pp. i359-i366, 2007.
[25] D. Park et al., “IsoBase: A Database of Functionally Related Proteins Across PPI Networks,” Nucleic Acids Research, vol. 39, pp. D295-D300, 2011.
[26] R.Y. Pinter et al., “Alignment of Metabolic Pathways,” Bioinformatics, vol. 21, pp. 3401-3408, 2005.
[27] R. Sharan et al., “Conserved Patterns of Protein Interaction in Multiple Species,” Proc. Nat'l Academy of Sciences of USA, vol. 102, pp. 1974-1979, 2005.
[28] T. Shlomi et al., “QPath: A Method for Querying Pathways in a Protein-Protein Interaction Network,” BMC Bioinformatics, vol. 7, p. 199, 2006.
[29] R. Singh, J. Xu, and B. Berger, “Pairwise Global Alignment of Protein Interaction Networks by Matching Neighborhood Topology,” Proc. 11th Ann. Int'l Conf. Research in Computational Molecular Biology (RECOMB), 2007.
[30] R. Singh, J. Xu, and B. Berger, “Global Alignment of Multiple Protein Interaction Networks,” Proc. Pacific Symp. Biocomputing, 2008.
[31] R. Singh, J. Xu, and B. Berger, “Global Alignment of Multiple Protein Interaction Networks with Appication to Functional Orthology Detection,” Proc. Nat'l Academy of Sciences of USA, vol. 105, pp. 12763-12768, 2008.
[32] P. Sridhar, T. Kahveci, and S. Ranka, “An Iterative Algorithm for Metabolic Network-Based Drug Target Identification,” Proc. Pacific Symp. Biocomputing, 2007.
[33] D. Szklarczyk et al., “The STRING Database in 2011: Functional Interaction Networks of Proteins, Globally Integrated and Scored,” Nucleic Acids Research, vol. 39, pp. D561-D568, 2011.
[34] Y. Tohsato and Y. Nishimura, “Metabolic Pathway Alignment Based on Similarity of Chemical Structures,” Information and Media Technologies, vol. 3, pp. 191-200, 2008.
[35] E.O. Voit, Computational Analysis of Biochemical Systems: A Practical Guide for Biochemists and Molecular Biologists. Cambridge Univ. Press, 2000.
[36] N. Watanabe et al., “Crystal Structure of LL-Diaminopimelate Aminotransferase from Arabidopsis Thaliana: A Recently Discovered Enzyme in the Biosynthesis of L-Lysine by Plants and Chlamydia,” J. Molecular Biology, vol. 371, pp. 685-702, 2007.
[37] K. Zhu et al., “BMC: An Efficient Method to Evaluate the Probabilistic Reachability Queries,” Proc. 16th Int'l Conf. Database Systems for Advanced Applications, 2011.
34 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool