A semidefinite programming approach to side chain positioning with new rounding strategies

INFORMS Journal on Computing

Volumn 16, Issue 4, 2004, Pages 380-392

  Chazelle, Bernard ^a   Kingsford, Carl ^a   Singh, Mona ^a  

^a Princeton University   (United States)

Author keywords

Computational biology; Semidefinite programming; Side chain positioning

Indexed keywords

ALGORITHMS; AMINO ACIDS; COMPUTATIONAL METHODS; HEURISTIC METHODS; MATHEMATICAL MODELS; MOLECULAR BIOLOGY; PROBLEM SOLVING;

CARBON ATOM; COMPUTATIONAL BIOLOGY; SEMIDEFINITE PROGRAMMING; SIDE CHAIN POSITIONING;

PROTEINS;

EID: 10044241588     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1040.0096     Document Type: Article

References (47)

1. Alizadeh, F. 1995. Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J. Optim. 5 13-51.
2. Alon, N., N. Kahale. 1998. Approximating the independence number via the Θ-function. Math. Programming 80 253-264.
3. Althaus, E., O. Kohlbacher, H.-P. Lenhof, P. Müller. 2000. A combinatorial approach to protein docking with flexible side-chains. Proc. Fourth Annual Internat. Conf. Comput. Molecular Biol., ACM Press, New York, 15-24.
4. Arora, S., M. Safra. 1998. Probabilistic checking of proofs: A new characterization of NP. J. ACM 45 70-122.
5. Arora, S., C. Lund, R. Motwani, M. Sudan, M. Szegedy. 1998. Proof verification and hardness of approximation problems. J. ACM 45 501-555.
6. Banner, D. W., A. Bloomer, G. A. Petsko, D. C. Phillips, I. A. Wilson. 1976. Atomic coordinates for triose phosphate isomerase from chicken muscle. Biochem. Biophys. Res. Commun. 72 146-155.
7. Benson, S. J., Y. Ye, X. Zhang. 1999. Mixed linear and semidefinite programming for combinatorial and quadratic optimization. Optim. Methods Software 11 515-544.
8. Bertsimas, D., Y. Ye. 1998. Semidefinite relaxations, multivariate normal distributions, and order statistics. D.-Z. Du, P. M. Pardalos, eds. Handbook of Combinatorial Optimization, Vol. 3. Kluwer Academic Publishers, New York, 1-19.
9. Boppana, R. B. 1987. Eigenvalues and graph bisection: An average-case analysis. Proc. Twenty-eighth Annual Sympos. Foundation Comput, Sci., IEEE Computer Society Press, Washington, D.C., 280-285.
10. Bower, M. J., F. E. Cohen, R. L. Dunbrack, Jr. 1997. Prediction of protein side-chain rotamers from a backbone-dependent rotamer library: A homology modeling tool. J. Molecular Biol. 267 1268-1282.
11. Cornell, W. D., P. Cieplak, C. I. Bayly, I. R. Gould, K. M. Merz, Jr., D. M. Ferguson, D. C. Spellmeyer, T. Fox, J. W. Caldwell, P. A. Kollman. 1995. A second generation force field for the simulation of proteins, nucleic acids, and organic molecules. J. Am. Chemical Soc. 117 5179-5197.
12. Dahiyat, B. I., S. L. Mayo. 1997. De novo protein design: Fully automated sequence selection. Science 278 82-87.
13. Desmet, J., M. De Maeyer, I. Lasters. 1994. The "dead end elimination" theorem as a new approach to the side-chain packing problem. K. Merz, S. LeGrand, eds. The Protein Folding Problem and Tertiary Structure Prediction. Birkhäuser, Boston, MA, 307-337.
14. Desmet, J., M. De Maeyer, B. Hazes, I. Lasters. 1992. The dead-end elimination theorem and its use in protein side-chain positioning. Nature 356 539-542.
15. Donath, W. E., A. Hoffman. 1972. Algorithms for partitioning of graphs and computer logic based on eigenvectors of connection matrices. IBM Tech. Disclosure Bull. 15 938-944.
16. Dunbrack, Jr., R. L., M. Karplus. 1993. Backbone-dependent rotamer library for proteins: Application to side-chain prediction. J. Molecular Biol. 230 543-574.
17. Eriksson, O., Y. Zhou, A. Elofsson. 2001. Side chain-positioning as an integer programming problem. Proc. First Workshop Algorithms BioInformatics., BRICS, University of Aarhus, Denmark, 129-141.
18. Feige, U., J. Kilian. 1998. Heuristics for finding large independent sets, with applications to coloring semi-random graphs. Proc. Thirty-ninth Annual Sympos. Foundation Comput. Sci., IEEE Computer Society, Los Alamitos, CA, 674-683.
19. Fourer, R., D. M. Gay, B. W. Kernighan. 2002. AMPL: A Modeling Language for Mathematical Programming. Brooks/Cole Publishing Company, Pacific Grove, CA.
20. Frieze, A., M. Jerrum. 1997. Improved approximation algorithms for MAX k-CUT and MAX BISECTION. Algorithmica 18 61-77.
21. Fujisawa, K., M. Fukuda, M. Kojima, K. Nakata. 1997. Numerical evaluation of SDPA. Technical report B-330, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Oh-Okayama, Meguro-ku, Tokyo 152, Japan.
22. Goemans, M. X., D. P. Williamson. 1995. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42 1115-1145.
23. Goldstein, R. F. 1994. Efficient rotamer elimination applied to protein side-chains and related spin glasses. Biophys. J. 66 1335-1340.
24. Gordon, D. B., S. L. Mayo. 1998. Radical performance enhancements for combinatorial optimization algorithms based on the dead-end elimination theorem. J. Comput. Chem. 19 1505-1514.
25. Grötschel, M., L. Lovász, A. Schrijver. 1993. Geometric Algorithms and Combinatorial Optimization, 2nd ed. Springer-Verlag, Berlin, Germany.
26. ILOG CPLEX. 2000. ILOG CPLEX 7.1. http://www.ilog.com/.
27. Karger, D., R. Motwani, M. Sudan. 1998. Approximate graph coloring by semidefinite programming. J. ACM 45 246-265.
28. Kohlbacher, O., H.-P. Lenhof. 2000. BALL - rapid software prototyping in computational molecular biology. Bioinformatics 16 815-824.
29. Lasters, I., M. De Maeyer, J. Desmet. 1995. Enhanced dead-end elimination in the search for the global minimum energy conformation of a collection of protein side chains. Protein Engrg. 8 815-822.
30. Lau, H. C. 2002. A new approach for weighted constraint satisfaction. Constraints 7 151-165.
31. Lau, H. C., O. Watanabe. 1996. Randomized approximation of the constraint satisfaction problem. R. Karlsson, A. Lingas, eds. Proc. Fifth Scandinavian Workshop Algorithm Theory, Springer, Berlin, Germany, 76-87.
32. Leach, A. R., A. P. Lemon. 1998. Exploring the conformational space of protein side chains using dead-end elimination and the A* algorithm. Proteins 33 227-239.
33. Lee, C. 1994. Predicting protein mutant energetics by self-consistent ensemble optimization. J. Molecular Biol. 236 918-939.
34. Lee, C., S. Subbiah. 1991. Prediction of protein side-chain conformation by packing optimization. J. Molecular Biol. 217 373-388.
35. Lesk, A. M., C.-I. Brändén, C. Chothia. 1989. Structural principles of α/β barrel proteins: The packing of the interior of the sheet. Proteins 5 139-148.
36. Lovász, L. 1979. On the Shannon capacity of a graph. IEEE Trans. Inform. Theory 25 1-7.
37. Malakauskas, S. M., S. L. Mayo. 1998. Design, structure and stability of a hyperthermophilic protein variant. Nature Structural Biol. 5 470-475.
38. Mueller, U., D. Perl, F. X. Schmid, U. Heinemann. 2000. Thermal stability and atomic-resolution crystal structure of the Bacillus caldolyticus cold shock protein. J. Molecular Biol. 297 975-988.
39. Nesterov, Y., A. Nemirovskii. 1993. Interior Point Polynomial Methods in Convex Programming: Theory and Algorithms. SIAM, Philadelphia, PA.
40. Nicholls, A., K. A. Sharp, B. Honig. 1991. Protein folding and association: Insights from the interfacial and thermodynamic properties of hydrocarbons. Proteins 11 281-296.
41. Pierce, N. A., E. Winfree. 2002. Protein design is NP-hard. Protein Engrg. 15 779-782.
42. Ponder, J. W., F. M. Richards. 1987. Tertiary templates for proteins: Use of packing criteria in the enumeration of allowed sequences for different structural classes. J. Molecular Biol. 193 775-791.
43. Raghavan, P., C. Thompson. 1987. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica 7 365-374.
44. Rolim, J. D. P., L. Trevisan. 1998. A case study of de-randomization methods for combinatorial approximation problems. J. Combin. Optim. 2 219-236.
45. Seneta, E. 1981. Non-Negative Matrices and Markov Chains, 2nd ed. Springer-Verlag, New York.
46. Vandenberghe, L., S. Boyd. 1996. Semidefinite programming. SIAM Rev. 38 49-95.
47. Zwick, U. 1999. Outward rotations: A tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems. Proc. Thirty-first Annual ACM Sympos. Theory Comput., ACM Press, New York, 679-687.