Solving and analyzing side-chain positioning problems using linear and integer programming

Bioinformatics

Volumn 21, Issue 7, 2005, Pages 1028-1036

  Kingsford, Carleton L ^a   Chazelle, Bernard ^a   Singh, Mona ^a  

^a Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; AMINO ACID SEQUENCE; ARTICLE; COMPUTER PROGRAM; CONTROLLED STUDY; MATHEMATICAL COMPUTING; PRIORITY JOURNAL; PROBLEM SOLVING; PROTEIN STRUCTURE; SEQUENCE HOMOLOGY; STATISTICAL ANALYSIS; STATISTICAL SIGNIFICANCE; SYSTEM ANALYSIS;

EID: 16344382546     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/bti144     Document Type: Article

References (40)

1. Althaus,E., Kohlbacher,O., Lenhof,H.-P. and Müller,P. (2000) A combinatorial approach to protein docking with flexible side-chains. In Proceedings of the 4th Annual International Conference on Computational Molecular Biology. ACM Press, New York, NY, pp. 15-24.
2. Bahadur,K.C.D., Akutsu,T., Tomita,E. and Seki,T. (2004) Protein side-chain packing problem: a maximum edge-weight clique algorithmic approach. In Proceedings of the Second Conference on Asia-Pacific Bioinformatics, Australian Computer Society Inc., Darlinghurst, Australia, pp. 191-200.
3. Bower,M.J., Cohen,F.E. and Dunbrack,R.L.,Jr. (1997) Prediction of protein side-chain rotamers from a backbone-dependent rotamer library: a homology modeling tool. J. Mol. Biol., 267 1268-1282.
4. Canutescu,A.A., Shelenkov,A.A. and Dunbrack,R.L.,Jr. (2003) A graph-theory algorithm for rapid protein side-chain prediction. Protein Sci., 12, 2001-2O14.
5. Chazelle,B., Kingsford,C. and Singh,M. (2004) A semidefinite-programming approach to side-chain positioning with new rounding strategies. INFORMS J. Comput., 16, 380-392.
6. Dahiyat,B.I. and Mayo,S.L. (1997) De novo protein design: fully automated sequence selection. Science, 278, 82-87.
7. Desmet,J., De Maeyer,M., Hazes,B. and Lasters,I. (1992) The dead-end elimination theorem and its use in protein side-chain positioning. Nature, 356, 539-542.
8. Desmet,J., De Maeyer,M. and Lasters,I. (1994) The 'dead-end elimination' theorem as a new approach to the side-chain packing problem. In Merz,K. and LeGrand,S. (eds), The Protein Folding Problem and Tertiary Structure Prediction, Birkhäuser, Boston, MA, USA, pp. 307-337.
9. Dunbrack,R.L.,Jr. and Karplus,M. (1993) Backbone-dependent rotamer library for proteins: application to side-chain prediction. J. Mol. Biol., 230, 543-574.
10. Eriksson,O., Zhou,Y. and Elofsson,A. (2001) Side chain-positioning as an integer programming problem. In Proceedings of 1st Workshop on Algorithms in BioInformatics, BRICS, University of Aarhus, Denmark, pp. 129-141.
11. Fourer,R., Gay,D.M. and Kernighan,B.W. (2002) AMPL A Modeling Language for Mathematical Programming. Brooks/Cole Publishing Company, Pacific Grove, CA.
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., Hom,G., Mayo,S. and Pierce,N. (2002) Exact rotamer optimization for protein design. J. Comput. Chem., 24 232-243.
14. Gordon,D.B. and Mayo,S.L. (1998) Radical performance enhancements for combinatorial optimization algorithms based on the dead-end elimination theorem. J. Comput. Chem., 19, 1505-1514.
15. Harbury,P.B., Plecs,J.J., Tidor,B., Alber,T. and Kim,P.S. (1998) High-resolution protein design with backbone freedom. Science 282, 1462-1467.
16. Holm,L.S. and Sander,C. (1991) Database algorithm for generating protein backbone and side-chain coordinates from a Calpha trace: application to model building and detection of coordinate errors. J. Mol. Biol., 218, 183-194.
17. ILOG CPLEX (2000). ILOG CPLEX 7.1.
18. Jones,T.A. and Kleywegt,G.J. (1999) CASP3 comparative modeling evaluation. Proteins, 37, 30-46.
19. Klepeis,J.L., Floudas,C.A., Morikis,D., Tsokos,C.G., Argyropoulos,E., Spruce,L. and Lambris,J.D. (2003) Integrated computational and experimental approach for lead optimization and design of compstatin variants with improved activity. J. Am. Chem. Soc., 125, 8422-8423.
20. Kohlbacher,O. and Lenhof,H.-P. (2000) BALL - rapid software prototyping in computational molecular biology. Bioinformatics, 16, 815-824.
21. Lasters,I., De Maeyer,M. and Desmet,J. (1995) Enhanced dead-end elimination in the search for the global minimum energy conformation of a collection of protein side chains. Protein Eng., 8, 815-822.
22. Leach,A.R. and Lemon,A.P. (1998) Exploring the conformational space of protein side chains using dead-end elimination and the A* algorithm. Proteins, 33, 227-239.
23. Lee,C. (1994) Predicting protein mutant energetics by self-consistent ensemble optimization. J. Mol. Biol., 236, 918-939.
24. Lee,C. and Subbiah,S. (1991) Prediction of protein side-chain conformation by packing optimization. J. Mol. Biol., 217, 373-388.
25. Lilien,R.H., Stevens,B.W., Anderson,A.C. and Donald,B.R. (2004) A novel ensemble-based scoring and search algorithm for protein redesign, and its application to modify the substrate specificity of the gramicidin synthetase a phenylalanine adenylation enzyme. In Proceedings of the 8th Annual International Conference on Computational Molecular Biology, ACM Press, New York, NY, pp. 46-57.
26. Looger,L.L., Dwyer,M.A., Smith,J.J. and Hellinga,H.W. (2003) Computational design of receptor and sensor proteins with novel functions. Nature, 423, 185-190.
27. 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 structural genomics. J. Mol. Biol., 307, 429-445.
28. Malakauskas,S.M. and Mayo,S.L. (1998) Design, structure and stability of a hyperthermophilic protein variant. Nat. Struct. Biol. 5, 470-475.
29. Martin,A.C.R. (2001) Profit program version 2.2.
30. McLachlan,A.D. (1982) Rapid comparison of protein structures. Acta Crystallogr., A38, 871-873.
31. Nicholls,A., Sharp,K.A. and Honig,B. (1991) Protein folding and association: insights from the interfacial and thermodynamic properties of hydrocarbons. Proteins, 11, 281-296.
32. Park,S., Yang,X. and Saven,J.G. (2004) Advances in computational protein design. Curr Opin. Struct. Biol., 14, 487-494.
33. Petrey,D., Xiang,Z., Tang,C., Xie,L., Gimpelev,M., Mitros,T., Soto,C., Goldsmith-Fischman,S., Kernytsky,A., Schlessinger,A. et al. (2003) Using multiple structure alignments, fast model building and energetic analysis in fold recognition and homology modeling. Proteins 53, 430-435.
34. Pierce,N.A. and Winfree,E. (2002) Protein design is NP-hard. Protein Eng., 15, 779-782.
35. Ponder,J.W. and Richards,F.M. (1987) Tertiary templates for proteins: use of packing criteria in the enumeration of allowed sequences for different structural classes. J. Mol. Biol., 193, 775-791.
36. Samudrala,R. and Moult,J. (1998) A graph-theoretic algorithm for comparative modeling of protein structure. J. Mol. Biol., 279, 287-302.
37. Summers,N. and Karplus,M. (1989) Construction of side-chains in homology modeling: application to the C-terminal lobe of rhizopuspepsin. J. Mol. Biol., 210, 785-811.
38. Thompson,J.D., Higgins,D.G. and Gibson,T.J. (1994) Clustal W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, positions-specific gap penalties and weight matrix choice. Nucleic Acids Res., 22, 4673-4680.
39. Ventura,S. and Serrano,L. (2004) Designing proteins from the inside out. Proteins, 56, 1-10.
40. Xiang,Z. and Honig,B. (2001) Extending the accuracy limits of prediction for side-chain conformations. J. Mol. Biol., 311, 421-430.