Residue-rotamer-reduction algorithm for the protein side-chain conformation problem

Bioinformatics

Volumn 22, Issue 2, 2006, Pages 188-194

  Xie, Wei ^a   Sahinidis, Nikolaos V ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACCURACY; ALGORITHM; ARTICLE; COMPUTER PROGRAM; INTERMETHOD COMPARISON; MATHEMATICAL COMPUTING; PREDICTION; PRIORITY JOURNAL; PROCESS OPTIMIZATION; PROTEIN CONFORMATION; PROTEIN LOCALIZATION; PROTEIN STRUCTURE; REDUCTION KINETICS; RELIABILITY; RESIDUE ANALYSIS; STRUCTURAL PROTEOMICS; SYSTEM ANALYSIS; TIME;

EID: 32144439339     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/bti763     Document Type: Article

References (28)

1. Althaus,E. et al. (2002) A combinatorial approach to predict protein docking with flexible side chains. J. Comput. Biol., 9. 597-612.
2. Bower,M. et al. (1997) Prediction of protein side-chain rotamers from a backbone-dependent library: A new homologous modeling tool. J. Mol. Biol., 267, 1268-1282.
3. Brooke,A., Kendrick,D. and Meeraus,A. (1998) GAMS - A User's Guide. GAMS Development Corporation, Washington, DC.
4. Canutescu,A.A. et al. (2003) A graph-theory algorithm for rapid protein side-chain prediction. Protein Eng., 12, 2001-2014.
5. Chazelle,B. et al. (2004) A semidefinite programming approach to side-chain positioning with new founding strategies. INFORMS J. Comput., 16, 308-392.
6. Dahiyat,B.I. and Mayo,S.L. (1994) Protein design automation. Protein Sci., 5, 895-903.
7. Dahiyat,B.I. and Mayo,S.L. (1997) De novo protein design: Fully automated sequence selection. Science, 278, 82-87.
8. Desmet,J. et al. (1992) The dead-end elimization theorem and its use in protein side-chain positioning. Nature, 346, 539-542.
9. Desmet,J., De Maeyer,M. and Lasters,I. (1994) The 'dead-end elimination' theorem: A new approach to the side-chain packing problem. In Merz,K.M. and Le grand,S.M. (eds), The Protein Folding Problem and Tertiary Structure Prediction, Brikhauser, Boston, MA, pp. 307-337.
10. Dunbrack,R. and Karplus.M. (1993) Backbone-dependent rotamer library for proteins - application to side-chain prediction. J. Mol. Biol., 230, 543-574.
11. Eriksson,O. et al. (2001) Side chain-positioning as an integer programming problem. LNCS, 2149, 128-141.
12. Goldstein,R.F. (1994) Efficient rotamer elimination applied to protein side-chains and related spin-glasses. Biophys. J., 66, 1335-1340.
13. Gordon,D.B. and Mayo,S.L. (1998) Radical performance enhancements for combinatorial optimization algorithms based on the dead-end elimination theorem. J. Comp. Chem., 19, 1505-1514.
14. Gordon,D.B. and Mayo,S.L. (1999) Branch-and-terminate: A combinatorial optimization algorithm for protein design. Structure, 7, 1089-1098.
15. Gordon,D.B. et al. (2003) Exact rotamer optimization for protein design. J. Comp. Chem., 23, 232-243.
16. Hellinga,H.W. and Richards,R.M. (1994) Optimal sequence selection in proteins of known structure by simulated evolution. Proc. Natl Acad. Sci. USA, 91, 5803-5807.
17. Kingsford,C. et al. (2005) Solving and analyzing side-chain positioning problems using linear and integer programming. Bioinformatics, 21, 1028-1039.
18. Kohlbacher,O. and Lenhof,H. (2000) BALL - rapid software prototyping in computational molecular biology. Bioinformatics, 16, 815-824.
19. Lasters,J. and Desmet,J. (1993) The fuzzy-end elimination theorem - correctly implementing the side-chain placement algorithm based on the dead-end elimination theorem. Protein Eng., 6, 717-722.
20. Leaver-Fay,A., Kuhlman,B. and Snoeyink,J. (2005) An adaptive dynamic programming algorithm for the side chain placement problem. In Altman,R.B., Dunker,A.K., Hunter,L., Jung,T.A. and Klein,T.E. (eds). Proceedings of the Pacific Symposium on Biocomputing 2005, World Scientific, Singapore, pp. 16-27.
21. Lee,C. and Levin,M. (1991) Accurate prediction of the stability and activity effects of site-directed mutagenesis on a protein core. Nature, 352, 448-451.
22. Looger,L.L. and Hellinga,H.W. (2001) Generalized dead-end elimination algorithms make large-scale protein side-chain structure prediction tractable: Implications for protein design and structure genomics. J. Mol. Biol., 307, 429-445.
23. Pierce,N.A. et al. (2000) Conformational splitting: A more powerful criterion for dead-end elimination. J. Comp. Chem., 21, 999-1009.
24. Pierce,N.A. and Winfree,E. (2002) Protein Design in NP-hard. Protein Eng., 15, 779-782.
25. Ponder, J.W. and Richards,F.M. (1987) Tertiary templetes for proteins: use of packing criteria in the enumeration of allowed sequences for different structural classes. J. Mol. Biol., 193, 775-792.
26. Voigt,C.A., Gordon,D.B. and Mayo,S.L. (2000) Trading accuracy for speed: a quantitative comparison of search algorithms in protein sequence desing. J. Mol. Biol., 299, 789-803.
27. Xiang,Z. and Honig,B. (2001) Extending the accuracy limits of prediction for sidechain conformations. J. Mol. Biol., 311, 421-430.
28. Xu,J. (2005) Rapid protein side-chain packing via tree-decomposition. Lecture Notes in Computer Science, 3500, 423-439.