A multithreaded algorithm for network alignment via approximate matching

International Conference for High Performance Computing, Networking, Storage and Analysis, SC

Volumn , Issue , 2012, Pages

  Khan, Arif M ^a   Gleich, David F ^a   Pothen, Alex ^a   Halappanavar, Mahantesh ^b  

^a Purdue University   (United States)

^b PACIFIC NORTHWEST NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE MATCHING; EXACT COMPUTATIONS; GRAPH ISOMORPHISM PROBLEM; HIGH-QUALITY SOLUTIONS; MAXIMUM WEIGHT MATCHING; MULTI-THREADED ALGORITHMS; OPTIMIZATION PROBLEMS; SUBGRAPH ISOMORPHISM PROBLEM;

ALIGNMENT; INTEGER PROGRAMMING; ITERATIVE METHODS; SET THEORY;

IMAGE MATCHING;

EID: 84877701883     PISSN: 21674329     EISSN: 21674337     Source Type: Conference Proceeding    
DOI: 10.1109/SC.2012.8     Document Type: Conference Paper

References (29)

1. D. Conte, P. P. Foggia, C. Sansone, and M. Vento, "Thirty years of graph matching in pattern recognition," International Journal of Pattern Recognition and Artificial Intelligence, vol. 18, no. 3, pp. 265-298, May 2004.
2. W. Hu, N. Jian, Y. Qu, and Y. Wang, "GMO: A graph matching for ontologies," in Proceedings of K-CAP Workshop on Integrating Ontologies, 2005, pp. 41-48. [Online]. Available: ftp1.de.freebsd.org/Publications/CEUR-WS/ Vol-156/paper7.pdf
3. S. Melnik, H. Garcia-Molina, and E. Rahm, "Similarity flooding: A versatile graph matching algorithm and its application to schema matching," in Proceedings of the 18th International Conference on Data Engineering. San Jose, CA: IEEE Computer Society, 2002, p. 117.
4. 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," PNAS, vol. 100, no. 20, pp. 11 394-11 399, September 2003. [Online]. Available: http://www.pnas.org/content/ 100/20/11394.abstract
5. R. Singh, J. Xu, and B. Berger, "Pairwise global alignment of protein interaction networks by matching neighborhood topology," in Proceedings of the 11th Annual International Conference on Research in Computational Molecular Biology (RECOMB), ser. Lecture Notes in Computer Science, vol. 4453. Oakland, CA: Springer Berlin / Heidelberg, 2007, pp. 16-31.
6. -, "Global alignment of multiple protein interaction networks with application to functional orthology detection," Proceedings of the National Academy of Sciences, vol. 105, no. 35, pp. 12 763-12 768, September 2008.
7. G. Klau, "A new graph-based method for pairwise global network alignment," BMC Bioinformatics, vol. 10, no. Suppl 1, p. S59, January 2009.
8. J. Flannick, A. Novak, B. S. Srinivasan, H. H. McAdams, and S. Batzoglou, "Græmlin: General and robust alignment of multiple large interaction networks," Genome Research, vol. 16, pp. 1169-1181, August 2006. [Online]. Available: http://ai.stanford.edu/~serafim/Publications/2006-Graemlin.pdf
9. J. Flannick, A. Novak, C. B. Do, B. S. Srinivasan, and S. Batzoglou, "Automatic parameter learning for multiple network alignment," in Proceedings of the 12th Annual International Conference on Computational Molecular Biology (RECOMB2008), 2008, pp. 214-231. [Online]. Available: http://ai.stanford.edu/~serafim/Publications/Graemlin2.0-submitted.pdf
10. O. Kuchaiev, T. Milenkovic, V. Memisevic, W. Hayes, and N. Przulj, "Topological network alignment uncovers biological function and phylogeny," arXiv, vol. 0810.3280, no. Version 3, p. Online, 2009. [Online]. Available: http://arxiv.org/abs/0810.3280
11. G. Kollias, S. Mohammadi, and A. Grama, "Network similarity decomposition (nsd): A fast and scalable approach to network alignment," Knowledge and Data Engineering, IEEE Transactions on, vol. PP, no. 99, p. 1, 2011.
12. N. Atias and R. Sharan, "Comparative analysis of protein networks: hard problems, practical solutions," Commun. ACM, vol. 55, no. 5, pp. 88-97, May 2012.
13. M. Bayati, D. F. Gleich, A. Saberi, and Y. Wang, "Message passing algorithms for sparse network alignment," Accepted, Transactions on Knowledge Discovery from Data, 2012. [Online]. Available: http://arxiv.org/abs/ 0907.3338
14. M. Bayati, M. Gerritsen, D. F. Gleich, A. Saberi, and Y. Wang, "Algorithms for large, sparse network alignment problems," in Proceedings of the 9th IEEE International Conference on Data Mining, December 2009, pp. 705-710.
15. M. Halappanavar, J. Feo, O. Villa, A. Tumeo, and A. Pothen, "Approximate weighted matching on emerging manycore and multithreaded architectures," International Journal of High Performance Computing Applications, p. Accepted, 2012.
16. R. Burkard, M. Dell'Amico, and S. Martello, Assignment Problems, 2nd ed. SIAM, 2012.
17. E. L. Lawler, "The quadratic assignment problem," Management Science, vol. 9, no. 4, pp. 586-599, July 1963. [Online]. Available: http://www.jstor.org/stable/2627364
18. S. Bradde, A. Braunstein, H. Mahmoudi, F. Tria, M. Weigt, and R. Zecchina, "Aligning graphs and finding substructures by a cavity approach," EPL (Europhysics Letters), vol. 89, no. 3, p. 37009, 2010.
19. M. Bayati, D. Shah, and M. Sharma, "Max-product for maximum weight matching: Convergence, correctness, and LP duality," Information Theory, IEEE Transactions on, vol. 54, no. 3, pp. 1241-1251, March 2008. (Pubitemid 351410929)
20. H. N. Gabow, "Data structures for weighted matching and nearest common ancestors with linking," in Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, ser. SODA '90. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, 1990, pp. 434-443. [Online]. Available: http://dl.acm.org/citation.cfm?id=320176.320229
21. K. Mehlhorn and G. Schäfer, "Implementation of O (nm log n) weighted matchings in general graphs: the power of data structures," J. Exp. Algorithmics, vol. 7, p. 4, December 2002. [Online]. Available: 10.1145/944618.944622
22. R. Preis, "Linear time 1/2-approximation algorithm for maximum weighted matching in general graphs," in STACS 99, ser. Lecture Notes in Computer Science, C. Meinel and S. Tison, Eds., vol. 1563. Springer Berlin / Heidelberg, 1999, pp. 259-269.
23. F. Manne and R. Bisseling, "A parallel approximation algorithm for the weighted maximum matching problem," in Parallel Processing and Applied Mathematics, ser. Lecture Notes in Computer Science, R. Wyrzykowski, J. Dongarra, K. Karczewski, and J. Wasniewski, Eds., vol. 4967. Springer Berlin / Heidelberg, 2008, pp. 708-717.
24. M. Halappanavar, "Algorithms for vertex-weighted matching in graphs," Ph.D. dissertation, Old Dominion University, Norfolk, VA, 2009.
25. J. Langguth, F. Manne, and P. Sanders, "Heuristic initialization for bipartite matching problems," ACM Journal of Experimental Algorithmics, vol. 15, 2010.
26. K. Kaya, J. Langguth, F. Manne, and B. Uçar, "Experiments on push-relabel-based maximum cardinality matching algorithms for bipartite graphs," CERFACS, Toulouse, France, Technical Report TR/PA/11/33, 2011. [Online]. Available: http://www.cerfacs.fr/algor/reports/2011/TR-PA-11-33.pdf
27. A.-L. Barabási and R. Albert, "Emergence of scaling in random networks," Science, vol. 286, no. 5439, pp. 509-512, October 1999.
28. A. Buluç and J. R. Gilbert, "The combinatorial BLAS: design, implementation, and applications," International Journal of High Performance Computing Applications, vol. 25, no. 4, pp. 496-509, November 2011.
29. U. Çatalyürek, F. Dobrian, A. Gebremedhin, M. Halappanavar, and A. Pothen, "Distributed-memory parallel algorithms for matching and coloring," in Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW), 2011 IEEE International Symposium on, May 2011, pp. 1971-1980.