Side chain-positioning as an integer programming problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2149, Issue , 2001, Pages 128-141

  Eriksson, Olivia ^a   Zhou, Yishao ^a   Elofsson, Arne ^a  

^a STOCKHOLM UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BIOINFORMATICS; CHAINS; FREE ENERGY; INTEGER PROGRAMMING; LINEAR PROGRAMMING; POLYNOMIAL APPROXIMATION; PROTEINS;

CONFORMATIONAL SPACE; DEAD-END ELIMINATION; INTEGER PROGRAMMING PROBLEMS; LINEAR INTEGER PROGRAMS; LINEAR PROGRAMMING RELAXATION; POLYNOMIAL TIME METHODS; PROGRAMMING PROBLEM; SIDE CHAIN POSITIONING;

PROBLEM SOLVING;

EID: 68549106477     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44696-6_10     Document Type: Conference Paper

References (21)

1. Dahiyat, B.I. and Mayo, S.L: De novo protein design: fully automated sequence selection. Science 278 (1997) 82–87
2. Ponder, J.W. and Richards, F.M.: Tertiary Templates for Proteins: Use of Packing Criteria in the Enumeration of Allowed Sequences for Different Structural Classes J. Mol. Biol. 193 (1987) 775–791
3. Dunbrack, R. and Karplus, M.: Backbone-dependent rotamer library for proteins - application to sidechain prediction. J. Mol. Biol. 230 (1993) 543–574
4. Metropolis, N., Metropolis, A.W., Rosenbluth, M.N. and Teller, A.H.: Equation of state computing on fast computing machines. J. Chem. Phys. 21 (1953) 1087–1092
5. LeGrand, S.M. and Mers Jr, K.M. The genetic algorithm and the conformational search of polypeptides and proteins. J. Mol. Simulation 13 (1994) 299–320
6. Desmat, J., De Maeyer, M., Hazes, B. and Lasters, I.: The dead end elimination theorem and its use in side-chain positioning. Nature 356 (1992) 539–542
7. Goldstein, R.F.: Efficient rotamer elimination applied to protein side-chains and related spin glasses. Biophysical J. 66 (1994) 1335–1340
8. Lasters, I., De Maeyer, M. and Desmet J.: Enhanced dead-end elimination in the search for the global minimum energy conformation of a collection of protein side chains. Protein Eng. 8 (1995) 815–822
9. Gordon, D.B. and Mayo, S.L.: Radical performance enhancements for combinatorial optimization algorithms based on the dead-end elimination theorem. J. Comp. Chem. 19 (1998) 1505–1514
10. Voigt, C.A., Gordon, D.B. and Mayo, S.L.: Trading accuracy for speed: A quantitative comparison of search algorithms in protein sequence design. J. Mol. Biol. 299 (2000) 789–803
11. Koehl, P. and Levitt, M.: De Novo Protein Design. I. In search of stability and specificity. J. Mol. Biol. 293 (1999) 1161–1181
12. Lueneberger, D.G.: Linear and nonlinear programming. Addison-Wesley publishing company (1973)
13. Nemhauser, G.L. and Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley- Interscience series in discrete mathematics and optimization (1988)
14. Korte, B. and Vygen, J.: Combinatorial optimization. Theory and algorithms Springer-Verlag (1991)
15. Lindeberg, P.O.: Opimeringslara: en introduction. Department of Optimization and Systems Theory,Royal institute of Technology, Stockholm (1990)
16. Karmarkar, N.: A New Polynomial Time Algorithm for Linear Programming. Combinatorica 4 (1984) 375–395
17. Pierce, N.A., Spriet, J.A., Desmet, J. and Mayo, S.L.: Conformational Splitting:A More Powerful criterion for Dead-End Elimination. J. Comp. Chem.21 (2000) 999–1009
18. Brooks, B.R., Bruccoleri, R.E., Olafson, B.D., States, D.J., Swaminathan, S. and Karplus, M.: CHARMM: A program for Macromolecular Energy, Minimization and Dynamics Calculations. Journal of Computational Chemistry 4 (1983) 187–217
19. Berkelaar, M: lp solve 3.1: Program with the Simplex algorithm. ftp://ftp.es.ele.tue.nl/pub/lp_solve (1996)
20. http://www.cplex.com
21. Rockafellar, R.T.: Network Flows and Monotropic Optimization. Wiley Interscience (1984)