1001 Optimal PDB structure alignments: Integer programming methods for finding the maximum contact map overlap

Journal of Computational Biology

Volumn 11, Issue 1, 2004, Pages 27-52

  Caprara, Alberto ^a   Carr, Robert ^b   Istrail, Sorin ^c,e   Lancia, Giuseppe ^d   Walenz, Brian ^c  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b SANDIA NATIONAL LABORATORIES   (United States)

^c Informatics Research   (United States)

^d UNIVERSITY OF UDINE   (Italy)

^e Applied Biosystems   (United States)

Author keywords

Contact map overlap; Integer programming; Lagrangian relaxation; Protein structure alignment

Indexed keywords

PROTEIN;

ANALYTIC METHOD; CLASSIFICATION; DRUG DESIGN; GENETIC ALGORITHM; GENOMICS; INTEGER PROGRAMMING; INTERMETHOD COMPARISON; MATHEMATICAL COMPUTING; MAXIMUM CONTACT MAP OVERLAP; MOLECULAR EVOLUTION; PEPTIDE MAPPING; PREDICTION; PRIORITY JOURNAL; PROCESS OPTIMIZATION; PROTEIN AGGREGATION; PROTEIN CLUSTERING; PROTEIN DATA BANK; PROTEIN FOLDING; PROTEIN STRUCTURE; REVIEW; SCOP CLASSIFICATION; SEQUENCE ALIGNMENT; SYSTEM ANALYSIS; VALIDATION PROCESS;

ALGORITHMS; COMPUTER SIMULATION; DATABASES, PROTEIN; MODELS, MOLECULAR; PROTEIN CONFORMATION; PROTEINS; SEQUENCE ALIGNMENT; SOFTWARE;

EID: 1842451398     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/106652704773416876     Document Type: Review

References (44)

1. Adams, W.P., and Sherali, H.D. 1986. A tight linearization and an algorithm for zero-one quadratic programming problems. Management Sci. 32, 1274-1290.
2. Balas, E., Ceria, S., and Cornuejols, G. 1993. A lift-and-project cutting plane algorithm for mixed 0-1 programs. Mathematical Programming 58, 295-324.
3. Balas, E., and Yu, C.S. 1986. Finding a maximum clique in an arbitrary graph. SIAM J. Comp. 15(4), 1054-1068.
4. Berman, H.M., Westbrook, J., Feng, Z., Gilliland, G., Bhat T.N., Weissig, H., Shindyalov, I.N., and Bourne, P.E. 2000. The protein data bank. Nucl. Acids Res. 28, 235-242. The PDB is at www.rcsb.org/pdb/.
5. Caprara, A., Fischetti, M., and Toth, P. 1999. A heuristic method for the set covering problem. Operations Res. 47, 730-743.
6. Caprara, A., and Lancia, G. 2002. Structural alignment of large-size proteins via Lagrangian relaxation. Proc. Ann. Int. Conf. on Computational Molecular Biology (RECOMB), 100-108.
7. Carraresi, P., and Malucelli, F. 1994. A reformulation scheme and new lower bounds for the QAP, in P.M. Pardalos and H. Wolkowicz, eds., Quadratic Assignment and Related Problems, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 147-160, AMS Press.
8. Çela, E. 1998. The Quadratic Assignment Problem: Theory and Algorithms, Kluwer Academic Publishers, NY.
9. Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., and Schrijver, A. 1998. Combinatorial Optimization, John Wiley, NY.
10. Eidhammer, I., Jonassen, I., and Taylor, W.R. 2000. Structure comparison and structure prediction. J. Comp. Biol. 5(5), 685-716.
11. Fisher, M.L. 1981. The Lagrangian relaxation method for solving integer programming problems. Management Sci. 27, 1-18.
12. Godzik, A. 1996. The structural alignment between two proteins: Is there a unique answer? Protein Sci. 5, 1325-1338.
13. Godzik, A., and Skolnick, J. 1994. Flexible algorithm for direct multiple alignment of protein structures and sequences. CABIOS 10(6), 587-596.
14. Godzik, A., Skolnick, J., and Kolinski, A. 1992. A topology fingerprint approach to inverse protein folding problem. J. Mol. Biol. 227, 227-238.
15. Goldman, D. 2000. Ph.D Thesis, U.C. Berkeley.
16. Goldberg, D.E. 1989. Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, MA.
17. Goldman, D., Istrail, S., and Papadimitriou, C. 1999. Algorithmic aspects of protein structure similarity. Proc. Ann. IEEE Symposium on Foundations of Computer Science (FOCS), 512-522.
18. Golumbic, M. 1980. Algorithmic Graph Theory and Perfect Graphs, Academic Press, NY.
19. Grötschel, M., Lovász, L., and Schrijver, A. 1981. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 169-197.
20. Havel, T.F., Kuntz, I.D., and Crippen, G.M. 1979. Effect of distance constraints on macromolecular conformation. Biopolymers 18.
21. Held, M., and Karp, R.M. 1971. The traveling salesman problem and minimum spanning trees: Part II. Mathematical Programming 1, 6-25.
22. Holland, J.H. 1992. Adaptation in Natural and Artificial Systems, MIT Press, Cambridge, MA.
23. Holm, L., and Sander, C. 1993. Protein structure comparison by alignment of distance matrices. J. Mol. Biol. 233, 123-138.
24. Holm, L., and Sander, C. 1995. 3-D lookup: Fast protein structure searches at 90% reliability. Proc. Ann. Int. Conf. on Intelligent Systems for Molecular Biology (ISMB), 179-187.
25. Holm, L., and Sander, C. 1996. Mapping the protein universe. Science 273, 595-602.
26. Johnson, D.S., and Trick, M.A., eds. 1996. Cliques, Coloring, and Satisfiability, vol. 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS Press.
27. Kabash, W. 1978. A solution for the best rotation to relate two sets of vectors. Acta Cryst. A32, 922-923.
28. Kachian, L.G. 1979. A polynomial algorithm for linear programming. Soviet Mathematics Doklady 20, 191-194.
29. Karmarkar, N. 1984. A new polynomial time algorithm for linear programming. Combinatorica 4, 375-395.
30. Lancia, G., Carr, R., Walenz, B., and Istrail, S. 2001. 101 optimal PDB structure alignments: A branch-and-cut algorithm for the maximum contact map overlap problem. Proc. Ann. Int. Conf. on Computational Biology (RECOMB), 193-202.
31. Lenhof, H.-P., Reinert, K., and Vingron, M. 1998. A polyhedral approach to RNA sequence structure alignment. J. Comp. Biol. 5(3), 517-530.
32. Lovász, L., and Schrijver, A. 1991. Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optimization 1, 166-190.
33. Lucas, A., Dill, K., and Istrail, S. Contact maps and the computational statistical mechanics aspects of protein folding. In preparation.
34. Mirny, L., and Domany, E. 1996. Protein fold recognition and dynamics in the space of contact maps. Proteins 26, 391-410.
35. Moult, J., Hubbard, T., Bryant, S., Fidelis, K., and Pedersen, J. 1997. Critical assessment of methods of proteins structure prediction (CASP): Round II. Proteins Suppl. 1, dedicated issue.
36. Moult, J., Hubbard, T., Fidelis, K., and Pedersen, J. 1999. Critical assessment of methods of proteins structure prediction (CASP): Round III. Proteins Suppl. 3, 2-6.
37. Murzin, A.G., Brenner, S.E., Hubbard, T., and Chothiak, C. 1995. SCOP: A structural classification of proteins database for the investigation of sequences and structures. J. Mol. Biol. 247, 536-540.
38. Needleman, S.B., and Wunsch, C.D. 1970. An efficient method applicable to the search for similarities in the amino acid sequences of two proteins. J. Mol. Biol. 48, 443-453.
39. Nemhauser, G.L., and Trotter, L.E. 1975. Vertex packings: Structural properties and algorithms. Mathematical Programming 8, 232-248.
40. Nemhauser, G.L., and Wolsey, L. 1988. Integer and Combinatorial Optimization, John Wiley, NY.
41. Orengo, C.A., Michie, A.D., Jones, S., Jones, D.T., Swindells, M.B., and Thornton, J.M. 1997. CATH - A hierarchic classification of protein domain structures. Structure 5(8), 1093-1108.
42. Skolnick, J. 2000. Personal communication.
43. Smith, T., and Waterman, M. 1981. Identification of common molecular subsequences. J. Mol. Biol. 147, 195-197.
44. Vendruscolo, M., Kussell, E., and Domany, E. 1997. Recovery of protein structure from contact maps. Fold. Des. 2, 295-306.