Protein design is NP-hard

Protein Engineering

Volumn 15, Issue 10, 2003, Pages 779-782

  Pierce, Niles A ^a   Winfree, Erik ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Complexity; Design; NP complete; NP hard; Proteins

Indexed keywords

ALGORITHM; AMINO ACID SEQUENCE; ARTICLE; COMPUTER MODEL; MATHEMATICAL ANALYSIS; PRIORITY JOURNAL; PROTEIN STRUCTURE;

EID: 0037412183     PISSN: 02692139     EISSN: None     Source Type: Journal    
DOI: 10.1093/protein/15.10.779     Document Type: Article

References (35)

1. Arora, S. (1998) J. Assoc. Comput. Machin., 45, 753-782.
2. Cook, S.A. 1971. In Proceedings of the 3rd ACM Symposium on the Theory of Computing. Association of Computing Machinery. New York, pp. 151-158.
3. Dahiyat, B.I. and Mayo, S.L. (1996) Protein Sci., 5, 895-903.
4. Dahiyat, B.I. and Mayo, S.L. (1997) Science, 278, 82-87.
5. Desjarlais, J.R. and Clarke, N.D. (1998) Curr. Opin. Struct. Biol., 8, 471-475.
6. Desjarlais, J.R. and Handel, T.M. (1995) Protein Sci., 4, 2006-2018.
7. Desmet, J., De Maeyer, M., Hazes, B. and Lasters, I. (1992) Nature, 356, 539-542.
8. Dunbrack, R.L., Jr and Karplus, M. (1993) J. Mol. Biol., 230, 543-574.
9. Garey, M.R. and Johnson, D.S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York.
10. Goldstein, R.F. (1994) Biophys. J., 66, 1335-1340.
11. Gordon, D.B. and Mayo, S.L. (1998) J. Comput. Chem., 19, 1505-1514.
12. Gordon, D.B. and Mayo, S.L. (1999) Structure, 7, 1089-1098.
13. Gordon, D.B., Marshall, S.A. and Mayo, S.L. (1999) Curr. Opin. Stuct. Biol., 9, 509-513.
14. Gordon, D.B., Hom, G.K., Mayo, S.L. and Pierce, N.A. (2003) J. Comput. Chem., 24 (2), to appear.
15. Hoos, H.H. and Stutzle, T. (2000) J. Autom. Reasoning, 24, 421-481.
16. Janin, J., Wodak, S., Levitt, M. and Maigret, D. (1978) J. Mol. Biol., 125, 357-386.
17. Karp, R.M. (1972) In Miller, R.E. and Thatcher, J.W. (eds), Complexity of Computer Computations. Plenum Press, New York, pp. 85-103.
18. Koehl, P. and Levitt, M. (1999) J. Mol. Biol., 293, 1161-1181.
19. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G. and Shmoys, D.B. (1985) The Traveling Salesman Problem. Wiley, New York.
20. Leach, A.R. and Lemon, A.P. (1998) Proteins, 33, 227-239.
21. Levin, L.A. (1973) Probl. Inf. Transmiss., 9, 265-266.
22. Looger, L.L. and Hellinga, H.W. (2001) J. Mol. Biol., 307, 429-445.
23. Malakauskas, S.M. and Mayo, S.L. (1998) Nature Struct. Biol., 5, 470-475.
24. Papadimitriou, C.H. and Steiglitz, K. 1982. Combinatorial Optimization: Algorithms and Complexity. Prentice Hall, Englewood Cliffs, NJ.
25. Pearl, J. 1988. Probabilistic Reasoning in Intelligent Systems. Morgan-Kauffman, San Francisco.
26. Pierce, N.A., Spriet, J.A., Desmet, J. and Mayo, S.L. (2000) J. Comput. Chem., 21, 999-1009.
27. Ponder, J.W. and Richards, F.M. (1987) J. Mol. Biol., 193, 775-791.
28. Sahni, S. and Gonzalez, T. (1976) J. Assoc. Comput. Machin., 23, 555-565.
29. Selman, B., Levesque, H. and Mitchell, D. (1992) In Proceedings of AAAI '92. MIT Press, Cambridge, MA, pp. 440-446.
30. Selman, B., Kautz, H.A. and Cohen, B. (1994) In Proceedings of AAAI '94. MIT Press, Cambridge, MA, pp. 337-343.
31. Shimaoka, M., Shifman, J.M., Jing, H., Takagi, J., Mayo, S.L. and Springer, T.A. (2000) Nature Struct. Biol., 7, 674-678.
32. Shimony, S.E. (1994) Artif. Intell., 68, 399-410.
33. Voigt, C.A., Gordon, D.B. and Mayo, S.L. (2000) J. Mol. Biol., 299, 789-803.
34. Weiss, Y. (2000) Neural Comput., 12, 1-41.
35. Wernisch, L., Hery, S. and Wodak, S.J. (2000) J. Mol. Biol., 301, 713-736.