Mixed-integer linear programming algorithm for a computational protein design problem

Industrial and Engineering Chemistry Research

Volumn 46, Issue 3, 2007, Pages 839-845

  Zhu, Yushan ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; INTEGER PROGRAMMING; LINEAR PROGRAMMING; PROBLEM SOLVING;

BINARY VARIABLES; COMPUTATIONAL PROTEIN; SEQUENCE SELECTION;

PROTEINS;

ALGORITHMS; COMPUTATION THEORY; INTEGER PROGRAMMING; LINEAR PROGRAMMING; PROBLEM SOLVING; PROTEINS;

EID: 33847277802     PISSN: 08885885     EISSN: None     Source Type: Journal    
DOI: 10.1021/ie0605985     Document Type: Article

References (37)

1. Dahiyat, B. I.; Mayo, S. L. De novo protein design: fully automated sequence selection. Science 1997, 278, 82-87.
2. Ponder, J. W.; Richards, F. M. Tertiary template for proteins: use of packing criteria in the enumeration of allowed sequences for different structural classes. J. Mol. Biol. 1987, 193, 775-791.
3. Dunbrack, R. L., Jr.; Karplus, M. Backbone-dependent rotamer library for proteins: application to side-chain prediction. J. Mol. Biol. 1993, 230, 543-574.
4. Bower, M. J.; Cohen, F. E.; Dunbrack, R. L., Jr. Prediction of protein side-chain rotamers from a backbone-dependent rotamer library: a homology modeling tool. J. Mol. Biol. 1997, 267, 1268-1282.
5. Xiang, Z.; Honig, B. Extending the accuracy limits of prediction for side-chain conformations. J. Mol. Biol. 2001, 311, 421-430.
6. Malakauskas, S. M.; Mayo, S. L. Design, structure and stability of a hyperthermophilic protein variant. Nature Struct. Biol. 1998, 5, 470-475.
7. Looger, L. L.; Dwyer, M. A.; Smith, J. J.; Hellinga, H. W. Computational design of receptor and sensor proteins with novel functions. Nature 2003, 423, 185-190.
8. Dwyer, M. A.; Looger, L. L.; Hellinga, H. W. Computational design of a biological active enzyme. Science 2004, 304, 1967-1971.
9. Floudas, C. A. Research challenges, opportunities and synergism in systems engineering and computational biology. AIChE J. 2005, 51, 1872-1884.
10. Floudas, C. A.; Fung, H. K.; McAllister, S. R.; Monnigmann, M.; Rajgaria, R. Advances in protein structure prediction and de novo protein design: A review. Chem. Eng. Sci. 2006, 61, 966-988.
11. Fung, H. K.; Rao, S.; Floudas, C. A.; Prokopyev, O.; Pardalos, P. M.; Rendl, F. Computational comparison studies of quadratic assignment like formulations for the in silico sequence selection problem in de novo protein design. J. Comb. Opt. 2005, 10, 41-60.
12. Morikis, D.; Soulika, A. M.; Mallik, B.; Klepeis, J. L.; Floudas, C. A.; Lambris, J. D. Improvement of the anti-C3 activity of compstain using rational and combinatorial approaches. Biochem. Soc. Trans. 2004, 32, 28-32.
13. Klepeis, J. L.; Floudas, C. A.; Morikis, D.; Tsokos, C. G.; Argyropoulos, E.; Spruce, L.; Lambris, J. D. Integrated computational and experimental approach for lead optimization and design of compstatin variants with improved activity. J. Am. Chem. Soc. 2003, 125, 8422-8423.
14. Desmet, J.; De Maeyer, M.; Hazers, B.; Lasters, I. The dead-end elimination theorem and its use in protein side-chain positioning. Nature 1992, 356, 539-542.
15. Dahiyat, B. I.; Mayo, S. L. Protein design automation. Protein Sci. 1996, 5, 895-903.
16. Goldstein, R. F. Efficient rotamer elimination applied to protein side chains and related spin glasses. Biophys. J. 1994, 66, 1335-1340.
17. Pierce, N. A.; Spriet, J. A.; Desmet, J.; Mayo, S. L. Conformational splitting: A more powerful criterion for dead-end elimination. J. Comp. Chem. 1999, 21, 999-1009.
18. Looger, L. L.; Hellinga, H. W. Generalized dead-end elimination algorithms make large-scale protein side-chain structure prediction tractable: implications for protein design and structural genomics. J. Mot. Biol. 2001, 307, 429-445.
19. Gordon, D. B.; Mayo, S. L. Radical performance enhancements for combinatorial optimization algorithms based on the dead-end elimination theorem. J. Comput. Chem. 1998, 19, 1505-1514.
20. Wernisch, L.; Hery, S.; Wodak, S. J. Automatic protein design with all atom force-fields by exact and heuristic optimization. J. Mol. Biol. 2000, 301, 713-736.
21. Pierce, N. A.; Winfree, E. Protein design is NP-hard. Protein Eng. 2002, 15, 779-782.
22. Chazelle, B.; Kingsford, C.; Singh, M. A semidefinite programming approach to side-chain positioning with new rounding strategies. INFORMS J. Comput. 2004, 16, 380-392.
23. Althaus, E.; Kohlbacher, O.; Lenhof, H.-P.; Muller, P. A combinatorial approach to protein docking with flexible side chains. J. Comput. Biol. 2002, 9, 597-612.
24. Klepeis, J. L.; Floudas, C. A.; Morikis, D.; Tsokos, C. G.; Lambris, J. D. Design of peptide analogues with improved activity using a novel de novo protein design approach. Ind. Eng. Chem. Res. 2004, 43, 3817-3826.
25. Kingsford, C. L.; Chazelle, B.; Singh, M. Solving and analyzing side-chain positioning problems using linear and integer programming. Bioinformatics 2005, 21, 1028-1036.
26. Nemhauser, G. L.; Wolsey, L. A. Integer and combinatorial optimization; John Wiley & Sons: New York, 1988.
27. Ahuja, R. K.; Magnanti, T. L.; Orlin, J. B. Network flows; Prentice Hall: Upper Saddle River, NJ, 1993.
28. ILOG CPLEX, version 9.0; 2003.
29. MacKerell, A. D., Jr.; Bashford, D.; Bellott, M.; et al. All-atom empirical potential for molecular modeling and dynamics studies of proteins. J. Phys. Chem. B 1998, 102, 3586-3616.
30. Street, A. G.; Mayo, S. L. Pairwise calculation of protein solvent accessible surface area. Folding Des. 1998, 3, 253-258.
31. Eisenhaber, F.; Lijnzaad, P.; Argos, P.; Sander, C.; Scharf, M. The double cubic lattice method: efficient approaches to numerical integration of surface area and volume and to dot surface contouring of molecular assemblies. J. Comput. Chem. 1995, 16, 273-284.
32. Berman, H. M.; Westbrook, J.; Feng, Z.; Gilliland, G.; Bhat, T. N.; Weissig, H.; Shindyalov, I. N.; Bourne, P. E. The Protein Data Bank. Nucleic Acids Res. 2000, 28, 235-242.
33. Kuhlman, B.; Baker, D. Native protein sequence are close to optimal for their structures. Proc. Natl. Acad. Sci. U.S.A. 2000, 97, 10383-10388.
34. Gordon, D. B.; Hom, G.; Mayo, S. L.; Pierce, N. Exact rotamer optimization for protein design. J. Comput. Chem. 2002, 24, 232-242.
35. Zhu, Y.; Kuno, T. Global optimization of nonconvex MINLP by a hybrid branch-and-bound and revised general Benders decomposition method. Ind. Eng. Chem. Res. 2003, 42, 528-539.
36. Balas, E.; Ceria, S.; Cornuejols, G. A lift-and-project cutting plane algorithm for mixed-integer 0-1 programs. Math. Program. 1993, 58, 295-324.
37. Zhu, Y.; Kuno, T. A disjunctive cutting plane based branch-andcut algorithm for 0-1 mixed-integer nonlinear programs. Ind. Eng. Chem. Res. 2006, 45, 187-196.