A combinatorial toolbox for protein sequence design and landscape analysis in the grand canonical model

Journal of Computational Biology

Volumn 9, Issue 5, 2002, Pages 721-741

  Aspnes, James ^a   Hartling, Julia ^b   Kao, Ming Yang ^c   Kim, Junhyong ^b   Shah, Gauri ^a  

^a Yale University   (United States)

^b YALE UNIVERSITY   (United States)

^c Northwestern University   (United States)

Author keywords

Combinatorial optimization; Computational hardness; Linear programming; Minimum cuts; Network flow; Protein 3D structures; Protein landscape analysis; Protein sequence design; The grand canonical model

Indexed keywords

PROTEIN;

ALGORITHM; AMINO ACID SEQUENCE; ARTICLE; PRIORITY JOURNAL; PROTEIN ANALYSIS; PROTEIN STRUCTURE; SYSTEM ANALYSIS;

ALGORITHMS; COMPUTER SIMULATION; MODELS, CHEMICAL; MODELS, THEORETICAL; MUTATION; PROGRAMMING, LINEAR; PROTEIN CONFORMATION; PROTEIN ENGINEERING; PROTEINS; REPRODUCIBILITY OF RESULTS; SOFTWARE DESIGN;

ANETHUM GRAVEOLENS;

EID: 12244267709     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/106652702761034154     Document Type: Article

References (38)

1. Ahuja, R.K., Magnanti, T.L., and Orlin, J.B. 1993. Networkfiows, Prentice Hall, Englewood Cliffs, NJ.
2. Atkins, J., and Hart, W.E. 1999. On the intractability of protein folding with a finite alphabet of amino acids. Algorithmica 25(2-3), 279-294.
3. Babajide, A., Hofacker, I., Sippl, M., and Stadler, P. 1997. Neutral networks in protein space: A computational study based on knowledge-based potentials of mean force. Folding and Design 2, 261-269.
4. Banavar, J., Cieplak, M., Maritan, A., Nadig, G., Seno, F., and Vishveshwara, S. 1998. Structure-based design of model proteins. Prot. Struct. Funct. Genet. 31, 10-20.
5. Bateman, A., Birney, E., Durbin, R., Eddy, S.R., Howe, K.L., and Sonnhammer, E.L.L. 2000. PFAM- A database of protein domain family alignments and HMMs. Nucl. Acids Res. 28, 263-266.
6. Berger, B., and Leighton, T. 1998. Protein folding in the hydrophobic-hydrophilic (HP) model is NP-complete. J. Comp. Biol. 5(1), 27-40.
7. Cormen, T.H., Leiserson, C.L., Rivest, R.L., and Stein, C. 2001. Introduction to Algorithms, 2nd Ed., MIT Press, Cambridge, MA.
8. Crescenzi, P., Goldman, D., Papadimitriou, C., Piccolboni, A., and Yannakakis, M. 1998. On the complexity of protein folding, J. Comp. Biol. 5(3), 423-466.
9. Deutsch, J.M., and Kurosky, T. 1996. New algorithm for protein design. Physical Review Letters 76:323-326.
10. Dill, K.A., Bromberg, S., Yue, K., Fiebig, K.M., Yee, D.P., Thomas, P.D., and Chan, H.S. 1995. Principles of protein folding - A perspective from simple exact models. Protein Sci. 4, 561-602.
11. Drexler, K.E. 1981. Molecular engineering: An approach to the development of general capabilities for molecular manipulation. Proc. Natl. Acad. Sci. USA 78, 5275-5278.
12. Eisenhaber, F., and Argos, P. 1993. Improved strategy in analytic surface calculation for molecular systems: Handling of singularities and computational efficiency. J. Comp. Chem. 14(N11), 1272-1280.
13. Eisenhaber, F., Lijnzaad, P., Argos, P., Sander, C., and Scharf, M. 1995. The double cube lattice method: Efficient approaches to numerical integration of surface area and volume and to dot surface contouring of molecular assemblies. J. Comp. Chem. 16(N3), 273-284.
14. Gabow, H.N. 1991. Applications of a poset representation to edge connectivity and graph rigidity. Proc. 32nd Ann. IEEE Symp. Foundations of Computer Science, 812-821.
15. Garey, M., and Johnson, D. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, NY.
16. Goldberg, A.V., and Tarjan, R.E. 1988. A new approach to the maximum-flow problem. J. ACM 35(4), 921-940.
17. Goldberg, L.A. 1993. Efficient Algorithms for Listing Combinatorial Structures. Cambridge University Press, Cambridge.
18. Grötschel, M., Lovász, L., and Schrijver, A. 1998. Geometric Algorithms and Combinatorial Optimization, Volume 2 of Algorithms and Combinatorics. Springer-Verlag, New York, NY.
19. Hart, W.E. 1997. On the computational complexity of sequence design problems. Proc. 1st Ann. Int. Conf. Computational Molecular Biology, 128-136.
20. Kimura, M. 1983. The Neutral Theory of Molecular Evolution, Cambridge University Press, London.
21. Kleinberg, J.M. 1999. Efficient algorithms for protein sequence design and the analysis of certain evolutionary fitness landscapes. Proc. 3rd Ann. Int. Conf. Computational Molecular Biology, 226-237.
22. Lau, K.F., and Dill, K.A. 1989. A lattice statistical mechanics model of the conformational and sequence spaces of proteins. Macromolecules 22, 3986-3997.
23. Lau, K.F., and Dill, K.A. 1990. Theory for protein mutability and biogenesis. Proc. Natl. Acad. Sci. USA 87, 638-642.
24. Lawler, E.L. 1972. A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem. Management Sci., 18,401-405.
25. Lipman, D., and Wilbur, W. 1991. Modeling neutral and selective evolution of protein folding. Proc. Royal Society of London Series B 245, 7-11.
26. Merz, K.M., and Grand, S.M.L., eds. 1994. The Protein Folding Problem and Tertiary Structure Prediction, Birkhauser, Boston, MA.
27. Micheletti, C., Seno, F., Maritan, A., and Banavar, J. 1998. Design of proteins with hydrophobic and polar amino acids. Prot. Struct. Func. Genet. 32, 80-87.
28. Papadimitriou, C.H., and Steiglitz, K. 1982. Combinatorial Optimization: Algorithms and Complexity. Prentice Hall, Upper Saddle River, NJ.
29. Picard, J.-C., and Queyranne, M. 1980. On the structure of all minimum cuts in a network and applications. Math. Prog. Study 13, 8-16.
30. Ponder, J., and Richards, F.M. 1987. Tertiary templates for proteins. J. Mol. Biol. 193, 63-89.
31. Provan, J.S., and Ball, M.O. 1983. The complexity of counting cuts and of computing the probability that a graph is connected. SIAM J. Computing 12(4), 777-788.
32. 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.
33. Shakhnovich, E.I., and Gutin, A.M. 1993. A new approach to the design of stable proteins. Protein Eng. 6, 793-800.
34. Smith, J.M. 1970. Natural selection and the concept of a protein space. Nature 225, 563-564.
35. Steiner, G. 1986. An algorithm to generate the ideals of a partial order. Operations Res. Lett. 5, 317-320.
36. Sun, S.J., Brem, R., Chan, H.S., and Dill, K.A. 1995. Designing amino acid sequences to fold with good hydrophobic cores. Protein Eng. 8(12), 1205-1213.
37. Vazirani, V.V., and Yannakakis, M. 1992. Suboptimal cuts: Their enumeration, weight and number (extended abstract). In Kuich, W., ed. Lecture Notes in Computer Science 623: Proceedings of the 19th International Colloquium on Automata, Languages, and Programming, 366-377, Springer-Verlag, New York, NY.
38. Yue, K., and Dill, K.A. 1992. Inverse protein folding problem: Designing polymer sequences. Proc. Natl. Acad. Sci. USA 89, 4163-4167.