Maximum contact map overlap revisited

Journal of Computational Biology

Volumn 18, Issue 1, 2011, Pages 27-41

  Andonov, Rumen ^a   Malod Dognin, Noël ^a   Yanev, Nicola ^b  

^a UNIVERSITÉ DE RENNES 1   (France)

^b UNIVERSITY OF SOFIA   (Bulgaria)

Author keywords

branch and bound; combinatorial optimization; contact map overlap; integer programming; Lagrangian relaxation; protein structure alignment

Indexed keywords

PROTEIN;

ALGORITHM; ARTICLE; CHEMICAL STRUCTURE; CHEMISTRY; COMPARATIVE STUDY; COMPUTER SIMULATION; PROTEIN CONFORMATION; PROTEIN DATABASE; STRUCTURAL HOMOLOGY;

ALGORITHMS; COMPUTER SIMULATION; DATABASES, PROTEIN; MODELS, MOLECULAR; PROTEIN CONFORMATION; PROTEINS; STRUCTURAL HOMOLOGY, PROTEIN;

EID: 78651321269     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2009.0196     Document Type: Article

References (25)

1. Agarwal, P., Mustafa, N., and Wang, Y. 2007. Fast molecular shape matching using contact maps. J. Comput. Biol. 14, 131-147.
2. Andonov, R., Balev, S., and Yanev, N. 2004. Protein threading: from mathematical models to parallel implementations. Inform. J. Comput. 16, 393-405.
3. Andonov, R., Yanev, N., and Malod-Dognin, N. 2008. An efficient Lagrangian relaxation for the contact map overlap problem. Proc. WABI-08 162-173.
4. Andreeva, A., Howorth, D., Chandonia, J.-M., et al. 2007. Data growth and its impact on the SCOP database: new developments. Nucleic Acids Res. 36, 419-425.
5. Caprara, A., Carr, R., Istrail, S., et al. 2004. 1001 optimal PDB structure alignments: integer programming methods for finding the maximum contact map overlap. J. Comput. Biol. 11, 27-52.
6. Caprara, A., and Lancia, G. 2002. Structural alignment of large-size proteins via Lagrangian relaxation. Proc. RECOMB-02 100-108.
7. Carr, R., and Lancia, G. 2004. Compact optimization can outperform separation: a case study in structural proteomics. 4OR: 2, 221-233.
8. Carr, R., Lancia, G., and Istrail, S. 2000. Branch-and-cut algorithms for independent set problems: integrality gap and an application to protein structure alignment [Technical report]. Sandia National Laboratories.
9. Garey, M., and Johnson, D. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York.
10. Gibrat, J.-F., Madej, T., and Bryant, S. 1996. Surprising similarities in structure comparison. Curr. Opin. Struct. Biol. 6, 377-385.
11. Godzik, A. 1996. The structural alignment between two proteins: is there a unique answer? Protein Sci. 5, 1325-1338.
12. Godzik, A., and Skolnick, J. 1994. Flexible algorithm for direct multiple alignment of protein structures and seequences. CABIOS 10, 587-596.
13. Goldman, D., Istrail, S., and Papadimitriu, C. 1999. Algorithmic aspects of protein structure similarity. Proc. FOCS-99: 512-521.
14. Guignard, M. 2003. Lagrangean relaxation. TOP 11, 151-200.
15. Held, M., Wolfe, P., and Crowder, H. 1974. Validation of subgradient optimization. Math. Program. 6, 62-88.
16. Jain, B., and Lappe, M. 2007. Joining softassign and dynamic programming for the contact map overlap problem. Lect. Notes Comput. Sci. 4414, 410-423.
17. Lancia, G., and Istrail, S. 2004. Protein structure comparison: algorithms and applications. Math. Methods Protein Struct. Anal. Design 1-33.
18. Lerman, I. 1993. Likelihood linkage analysis (lla) classification method (around an example treated by hand). Biochimie 75, 379-397.
19. Lerman, I., Peter, P., and Leredde, H. 1994. Principles and calculus of the implanted method in the CHAVL program (hierarchical classification by the analysis o the likelihood of the bonds) [in French]. Rev. Modulad 13, 63-90.
20. McGregor, J. 1982. Backtrack search algorithms and the maximal common subgraph. Software Pract. Exper. 12, 23-34.
21. Pelta, D., Gonzales, J., and Vega, M. 2008. A simple and fast heuristic for protein structure comparison. BMC Bioinform. 9, 161.
22. Strickland, D., Barnes, E., and Sokol, J. 2005. Optimal protein structure alignment using maximum cliques. Oper. Res. 53, 389-402.
23. Xie, W., and Sahinidis, N. 2007. A reduction-based exact algorithm for the contact map overlap problem. J. Comput. Biol. 14, 637-654.
24. Yanev, N., Veber, P., Andonov, R., et al. 2008. Lagrangian approaches for a class of matching problems in computational biology. Comput. Math. Appl. 55, 1054-1067.
25. Zhu, J., and Weng, Z. 2005. FAST: a novel protein structure alignment algorithm. Proteins 58, 618-627.