Lagrangian relaxation applied to sparse global network alignment

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7036 LNBI, Issue , 2011, Pages 225-236

  El Kebir, Mohammed ^a,b,c   Heringa, Jaap ^b,c,d   Klau, Gunnar W ^a,c  

^a CWI   (Netherlands)

^b VU UNIVERSITY AMSTERDAM   (Netherlands)

^c Netherlands Institute for Systems Biology   (Netherlands)

^d Netherlands Bioinformatics Centre   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BIOLOGICAL NETWORKS; COMPARISON METHODS; COMPUTATIONAL STUDIES; EXTENDED VERSIONS; GLOBAL NETWORKS; INTEGER LINEAR PROGRAMMING FORMULATION; LAGRANGIAN RELAXATION; NETWORK DATA; NETWORK LEVEL; NETWORK TOPOLOGY; PROTEIN INTERACTION NETWORKS; PSEUDO CODES; QUADRATIC ASSIGNMENT PROBLEMS; RUNNING TIME; SCORING SCHEMES; SOFTWARE TOOL; STATE-OF-THE-ART METHODS; TOPOLOGY AWARE; UPPER AND LOWER BOUNDS;

ACTIVE NETWORKS; BIOINFORMATICS; ELECTRIC NETWORK ANALYSIS; ELECTRIC NETWORK TOPOLOGY; INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS; PATTERN RECOGNITION; TOPOLOGY;

ALIGNMENT;

EID: 80455162614     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-24855-9_20     Document Type: Conference Paper

References (25)

1. Adams, W.P., Johnson, T.: Improved linear programming-based lower bounds for the quadratic assignment problem. DIMACS Series in Discrete Mathematics and Theoretical Computer Science (1994)
2. Alon, U.: Network motifs: theory and experimental approaches. Nat. Rev. Genet. 8(6), 450-461 (2007)
3. Ashburner, M., Ball, C.A., Blake, J.A., et al.: Gene ontology: tool for the unification of biology. Nat. Genet. 25 (2000)
4. Ay, F., Kellis, M., Kahveci, T.: SubMAP: Aligning Metabolic Pathways with Sub-network Mappings. J. Comput. Biol. 18(3), 219-235 (2011)
5. Caprara, A., Fischetti, M., Toth, P.: A heuristic method for the set cover problem. Oper. Res. 47, 730-743 (1999)
6. Edmonds, J.: Path, trees, and flowers. Canadian J. Math. 17, 449-467 (1965)
7. Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J.ACM 19, 248-264 (1972)
8. Flannick, J., Novak, A., Srinivasan, B.S., McAdams, H.H., Batzoglou, S.: Graemlin: general and robust alignment of multiple large interaction networks. Genome Res. 16(9), 1169-1181 (2006)
9. Guignard, M.: Lagrangean relaxation. Top 11, 151-200 (2003)
10. Held, M., Karp, R.M.: The traveling-salesman problem and minimum spanning trees: Part II. Math. Program 1, 6-25 (1971)
11. Jaeger, S., Sers, C., Leser, U.: Combining modularity, conservation, and interactions of proteins significantly increases precision and coverage of protein function prediction. BMC Genomics 11(1), 717 (2010)
12. Kanehisa, M., Goto, S., Hattori, M., et al.: From genomics to chemical genomics: new developments in KEGG. Nucleic Acids Res. 34, 354-357 (2006)
13. Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85-103. Plenum Press (1972)
14. Kelley, B.P., Sharan, R., Karp, R.M., et al.: Conserved pathways within bacteria and yeast as revealed by global protein network alignment. P. Natl. Acad. Sci. USA 100(20), 11394-11399 (2003)
15. Klau, G.W.: A new graph-based method for pairwise global network alignment. BMC Bioinform. 10(suppl.1), S59 (2009)
16. Koyutürk, M., Kim, Y., Topkara, U., et al.: Pairwise alignment of protein interaction networks. J. Comput. Biol. 13(2), 182-199 (2006)
17. Kuchaiev, O., Milenkovic, T., Memisevic, V., Hayes, W., Przulj, N.: Topological network alignment uncovers biological function and phylogeny. J. R. Soc. Interface 7(50), 1341-1354 (2010)
18. Kuhn, H.W.: The Hungarian method for the assignment problem. Nav. Res. Logist. Q 2(1-2), 83-97 (1955)
19. Lawler, E.L.: The quadratic assignment problem. Manage. Sci. 9(4), 586-599 (1963)
20. Munkres, J.: Algorithms for the assignment and transportation problems. SIAM J. Appl. Math. 5, 32-38 (1957)
21. Sharan, R., Ideker, T.: Modeling cellular machinery through biological network comparison. Nat. Biotechnol. 24(4), 427-433 (2006)
22. Sharan, R., Ideker, T., Kelley, B., Shamir, R., Karp, R.M.: Identification of protein complexes by comparative analysis of yeast and bacterial protein interaction data. J. Comput. Biol. 12(6), 835-846 (2005)
23. Singh, R., Xu, J., Berger, B.: Global alignment of multiple protein interaction networks with application to functional orthology detection. P. Natl. Acad. Sci. USA 105(35), 12763-12768 (2008)
24. Szklarczyk, D., Franceschini, A., Kuhn, M., et al.: The STRING database in 2011: functional interaction networks of proteins, globally integrated and scored. Nucleic Acids Res. 39, 561-568 (2010)
25. Wohlers, I., Andonov, R., Klau, G.W.: Algorithm engineering for optimal alignment of protein structure distance matrices. Optim. Lett. (2011)