Algorithms for large, sparse network alignment problems

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2009, Pages 705-710

  Bayati, Mohsen ^a   Gerritsen, Margot ^b   Gleich, David F ^b   Saberi, Amin ^b   Wang, Ying ^b  

^a Stanford University   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

Belief propagation; Graph matching; Message passing; Network alignment

Indexed keywords

BELIEF PROPAGATION; COMBINATORIAL OPTIMIZATION PROBLEMS; DATABASE MATCHING; DISTRIBUTED ALGORITHM; GRAPH MATCHING; NEAR-OPTIMAL SOLUTIONS; NP-HARD; ONTOLOGY MATCHING; SPARSE NETWORK; SYNTHETIC PROBLEM; SYSTEMS BIOLOGY; UNIFIED FRAMEWORK;

ALGORITHMS; ALIGNMENT; BIOINFORMATICS; BIOLOGY; COMBINATORIAL OPTIMIZATION; COMPUTER VISION; DATA FLOW ANALYSIS; DISTRIBUTED DATABASE SYSTEMS; MESSAGE PASSING; ONTOLOGY;

PATTERN MATCHING;

EID: 77951152701     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2009.135     Document Type: Conference Paper

References (23)

1. G. Klau, "A new graph-based method for pairwise global network alignment," BMC Bioinformatics, vol. 10, no. S1, p. S59, January 2009.
2. R. Singh, J. Xu, and B. Berger, "Pairwise global alignment of protein interaction networks by matching neighborhood topology," in Proc. of the 11th Annual Intl. Conf. on Research in Computational Molecular Biology (RECOMB), ser. LNCS, vol. 4453. Springer, 2007, pp. 16-31.
3. S. Melnik, H. Garcia-Molina, and E. Rahm, "Similarity flooding: A versatile graph matching algorithm and its application to schema matching," in Proc. of the 18th Intl. Conf. on Data Engineering. IEEE Computer Society, 2002, p. 117.
4. O. Šváb, "Exploiting patterns in ontology mapping," in Proc. of the 6th Intl. Semantic Web Conf., ser. LNCS, K. A. et al., Ed., vol. 4825. Berlin, Heidelberg: Springer, November 2007, pp. 950-954.
5. D. Conte, P. P. Foggia, C. Sansone, and M. Vento, "Thirty years of graph matching in pattern recognition," Intl. J. of Pattern Recognition and Artificial Intelligence, vol. 18, no. 3, pp. 265-298, May 2004.
6. C. Schellewald and C. Schnörr, "Probabilistic subgraph matching based on convex relaxation," in Energy Minimization Methods in Computer Vision and Pattern Recognition. Springer, 2005, pp. 171-186.
7. M. Bayati, M. Gerritsen, D. F. Gleich, A. Saberi, and Y. Wang, "Algorithms for large, sparse network alignment problems," arXiv, vol. 0907.3338, 2009.
8. R. Singh, J. Xu, and B. Berger, "Global alignment of multiple protein interaction networks with application to functional orthology detection," PNAS, vol. 105, no. 35, pp. 12 763-12 768, September 2008.
9. D. Conte, P. Foggia, and M. Vento, "Challenging complexity of maximum common subgraph detection algorithms: A performance analysis of three algorithms on a wide database of graphs," J. Graph Algorithms Appl., vol. 11, no. 1, pp. 99-143, 2007.
10. J. Berg and M. Lässig, "Cross-species analysis of biological networks by bayesian alignment," PNAS, vol. 103, no. 29, pp. 10 967-10 972, 2006.
11. J. Flannick, A. Novak, B. S. Srinivasan, H. H. McAdams, and S. Batzoglou, "Gramlin: General and robust alignment of multiple large interaction networks," Genome Research, vol. 16, pp. 1169-1181, August 2006.
12. S. Bradde, A. Braunstein, H. Mahmoudi, F. Tria, M. Weigt, and R. Zecchina, "Aligning graphs and finding substructures by message passing," arXiv, vol. 0905.1893, 2009.
13. M. Bayati, D. Shah, and M. Sharma, "Maximum weight matching via max-product belief propagation," in Intl. Symposium on Information Theory, 2005, pp. 1763-1767.
14. M. Mezard and R. Zecchina, "Random k-satisfiability: from an analytic solution to a new efficient algorithm," Phys.Rev. E, vol. 66, 2002.
15. R. G. Gallager, Low Density Parity Check Codes. MIT Press, Cambridge MA, 1963.
16. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Francisco, 1988.
17. M. Tappen and W. Freemand, "Graph cuts and belief propagation for stereo, using identical mrf parameters," in ICCV, 2003.
18. C. Yanover and Y. Weiss, "Approximate inference and protein folding," in NIPS, 2002.
19. B. J. Frey and D. Dueck, "Clustering by passing messages between data points." Science, vol. 315, no. 5814, pp. 972-976, February 2007.
20. K. Murphy, Y. Weiss, and M. Jordan., "Loopy belief propagation for approximate inference: An empirical study," in Proc. of Uncertainty in Artificial Intelligence (UAI), 1999.
21. A. Braunstein and R. Zecchina, "Learning by message passing in networks of discrete synapses," Phys. Rev. Lett., 2006.
22. Various, "Wikipedia XML database dump." http://en.wikipedia. org/wiki/Wikipedia:Database download, Apr. 2007.
23. W. W. Cohen, P. Ravikumar, and S. Fienberg, "A comparison of string metrics for matching names and records," in Proc. of the KDD Workshop on Data Cleaning and Object Consolidation, 2003.