Efficient algorithms for protein sequence design and the analysis of certain evolutionary fitness landscapes

Journal of Computational Biology

Volumn 6, Issue 3-4, 1999, Pages 387-404

  Kleinberg, Jon M ^a  

^a School of Operations Research and Information Engineering   (United States)

Author keywords

Combinatorial optimization; Evolutionary fitness landscapes; Inverse protein folding; Network flow algorithms; Protein sequence design

Indexed keywords

ALGORITHM; AMINO ACID SEQUENCE; CONFERENCE PAPER; HYDROPHOBICITY; MATHEMATICAL MODEL; PRIORITY JOURNAL; PROTEIN FOLDING; PROTEIN STRUCTURE; SEQUENCE ANALYSIS;

ALGORITHMS; DATABASES, FACTUAL; DRUG DESIGN; EVALUATION STUDIES; EVOLUTION, MOLECULAR; MODELS, STATISTICAL; POINT MUTATION; PROTEINS;

ANETHUM GRAVEOLENS;

EID: 0032749853     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/106652799318346     Document Type: Conference Paper

References (37)

1. Ahuja, R., Magnanti, T., and Orlin, J. 1993. Network Flows. Prentice-Hall, Englewood Cliffs, NJ.
2. Babajide, A., Hofacker, I., Sippl, M., and Stadler, P. 1997. Neutral networks in protein space: A computational study based on knowledge-based potentials on mean force. Folding Design 2, 261-269.
3. Banavar, J., Cieplak, M., Maritan, A., Nadig, G., Seno, F., and Vishveshwara, S. 1998. Structure-based design of model proteins. Proteins: Struct. Funct. Genet. 31, 10-20.
4. Bernstein, F.C., Koetzle, T.F., Williams, G.J.B., Meyer, E.F., Brice, M.D., Rodgers, J.R., Kennard, O., Shimanouchi, T., and Tasumi, M. 1977. The protein data bank: A computer-based archival file for macromolecular structures. J. Mol. Biol. 112, 535-542.
5. Chan, H.S., and Dill, K.A. 1996. Comparing folding codes for proteins and polymers. Proteins: Struct. Funct. Genet. 24, 335-344.
6. Cherkassky, B., and Goldberg, A.V. 1995. On implementing the push-relabel method for the maximum flow problem. Proc. MPS Symp. on Int. Prog, and Comb. Optimization 157-171. Implementation obtained from http://www.neci.nj. nec.com/homepages/avg/.
7. Cormen, T., Leiserson, C., and Rivest, R. 1990. Introduction to Algorithms. McGraw-Hill, New York.
8. Creighton, T.E. 1993. Proteins: Structure and Molecular Properties. Freeman, San Francisco.
9. Dill, K.A., Bromberg, S., Yue, K., Fiebig, K., Yee, D., Thomas, P., and Chan, H.S. 1995. Principles of protein folding-A perspective from simple exact models. Protein Sci. 4, 561-602.
10. Deutsch, J.M., and Kurosky, T. 1996. New algorithm for protein design. Phys. Rev. Lett. 76, 323-326.
11. Drexler, K.E. 1981. Molecular engineering: An approach to the development of general capabilities for molecular manipulation. Proc. Natl. Acad. Sci. U.S.A. 78, 5275-5278.
12. Eisenhaber, F., and Argos, P. 1993. Improved strategy in analytical surface calculation for molecular systems. J. Comput. Chem. 14, 1272-1280.
13. Eisenhaber, F., Lijnzaad, P., Argos, P., Sander, C., and Scharf, M. 1995. The double cubic lattice method. J. Comput. Chem. 16, 273-284.
14. Garey, M., and Johnson, D. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco.
15. Goldberg, A.V., and Tarjan, R.E. 1988. A new approach to the maximum flow problem. J. ACM 35, 921-940.
16. Grötschel, M., Lovász, L., and Schrijver, A. 1987. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, Berlin.
17. Hart, W. 1997. On the computational complexity of sequence design problems. Proc. RECOMB Conf. Comput. Mol. Biol. 128-136.
18. Holm, L., and Sander, C. 1994. Mapping the protein universe. Proteins: Struct. Funct. Genet. 19, 165.
19. Holm, L., and Sander, C. 1996. Searching protein structure databases has come of age. Science 273, 595.
20. Huynen, M., Stadler, P., and Fontana, W. 1996. Smoothness within ruggedness: The role of neutrality in adaptation. Proc. Natl Acad. Sci. U.S.A. 93, 397-401.
21. Kamtekar, S., Schiffer, J., Xiong, H., Babik, J., and Hecht, M. 1993. Protein design by binary patterning of polar and nonpolar amino acids. Science 262, 1680-1685.
22. Kimura, M. 1983. The Neutral Theory of Molecular Evolution, Cambridge University Press, Cambridge.
23. Lau, K.F., and Dill, K. 1989. Macromolecules 22, 3986-3997.
24. Lau, K.F., and Dill, K. 1990. Theory for protein mutability and biogenesis. Proc. Natl. Acad. Sci. U.S.A. 87, 638-642.
25. Lipman, D., and Wilbur, W. 1991. Modeling neutral and selective evolution of protein folding. Proc. Royal Soc. London B 245, 7-11.
26. Maynard Smith, J. 1970. Natural selection and the concept of a protein space. Nature (London) 225, 563-564.
27. Merz, K., and LeGrand, S., eds. 1994. The Protein Folding Problem and Tertiary Structure Prediction. Birkhäuser, Boston.
28. Micheletti, C., Seno, F., Maritan, A., and Banavar, J. 1998. Design of proteins with hydrophobic and polar amino acids. Proteins: Struct. Funct. Genet. 32, 80-87.
29. Nemhauser, G., and Wolsey, L. 1988. Integer and Combinatorial Optimization. Wiley, New York.
30. Ponder, J., and Richards, F.M. 1987. Tertiary templates for proteins. J. Mol. Biol. 193, 63-89.
31. Reidys, C., Stadler, P., and Schuster, P. 1997. Generic properties of combinatory maps: Neutral networks of RNA secondary structures. Bull. Math. Biol. 59, 339-397.
32. Richmond, T.J., and Richards, F.M. 1978. Packing of alpha-helices: Geometrical constraints and contact areas. J. Mol. Biol. 119, 537-555.
33. Sun, S., Brem, R., Chan, H.S., and Dill, K.A. 1995. Designing amino acid sequences to fold with good hydrophobic cores. Protein Eng. 8, 1205-1213.
34. Shakhnovich, E.I., and Gutin, A.M. 1993. A new approach to the design of stable proteins. Protein Eng. 6, 793-800.
35. Shakhnovich, E.I., Farztdinov, G., Gutin, A.M., and Karplus, M. 1991. Protein folding bottlenecks: A lattice Monte Carlo simulation. Phys. Rev. Lett. 67, 1665-1668.
36. Sleator, D., and Tarjan, R.E. 1983. A data structure for dynamic trees. J. Comput. Syst. Sci. 26, 362-391.
37. Yue, K., and Dill, K.A. 1992. Inverse protein folding problem: Designing polymer sequences. Proc. Natl. Acad. Sci. U.S.A. 89, 4163-4167.