Fast and accurate algorithms for protein side-chain packing

Journal of the ACM

Volumn 53, Issue 4, 2006, Pages 533-557

  Xu, Jinbo ^a,b   Berger, Bonnie ^a,c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Approximate algorithm; Polynomial time approximation scheme; Protein side chain packing; Tree decomposition

Indexed keywords

POLYNOMIAL-TIME APPROXIMATION SCHEMES (PTAS); PROTEIN SIDE CHAIN PACKING; PROTEIN STRUCTURES; TREE DECOMPOSITION;

ALGORITHMIC LANGUAGES; GLOBAL OPTIMIZATION; GRAPH THEORY; MOLECULAR GRAPHICS; POLYNOMIAL APPROXIMATION;

PROTEINS;

EID: 33748944332     PISSN: 00045411     EISSN: 00045411     Source Type: Journal    
DOI: 10.1145/1162349.1162350     Document Type: Article

References (43)

1. AKUTSU, T. 1997. NP-hardness results for protein side-chain packing. In Genome Informatics 8, S. Miyano and T. Takagi, Eds. 180-186.
2. ALEXANDROV, N., NUSSINOV, R., AND ZIMMER, R. 1996. Fast protein fold recognition via sequence to structure alignment and contact capacity potentials. In Biocomputing: Proceedings of 1996 Pacific Symposium.
3. AMIR, E. 2001. Efficient approximation for triangulation of minimum treewdith. In Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence (UAI '01). 7-15.
4. ARNBORG, S., CORNEIL, D., AND PROSKUROWSKI, A. 1987. Complexity of finding embedding in a k-tree. SIAM J. Algeb. Disc. Meth. 8, 277-284.
5. ARYA, S., MOUNT, D., NETANYAHU, N., SILVERMAN, R., AND WU, A. 1998. An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. J. ACM 45, 891-923.
6. BACH, F., AND JORDAN, M. 2002. Thin junction trees. In Advances in Neural Information Processing Systems (NIPS), T. Dietterich, S. Becker, and Z. Ghahramani, Eds. Vol. 14. 569-574.
7. BERRY, A., HEGGERNES, P., AND SIMONET, G. 2003. The minimum degree heuristic and the minimal triangulation process. In Lecture Notes in Computer Science, vol. 2880. Springer-Verlag, New York, 58-70.
8. BOWER, M., COHEN, F., AND DUNBRACK, JR., R. L. 1997. Prediction of protein side-chain rotamers from a backbone-dependent rotamer library: A new homology modeling tool. J. Mol. Biol. 267, 1268-1282.
9. CANUTESCU, A., SHELENKOV, A., AND DUNBRACK, JR., R. L. 2003. A graph-theory algorithm for rapid protein side-chain prediction. Prot. Sci. 12, 2001-2014.
10. CHAZELLE, B., KINGSFORD, C., AND SINGH, M. 2004. A semidefinite programming approach to side-chain positioning with new rounding strategies. INFORMS J. Comput. Special Issue in Computational Molecular Biology/Bioinformatics, 86-94.
11. DESMET, J., MAEYER, M. D., HAZES, B., AND LASTER, I. 1992. The dead-end elimination theorem and its use in protein side-chain positioning. Nature 356, 539-542.
12. DESMET, J., SPRIET, J., AND LASTER, I. 2002. Fast and accurate side-chain topology and energy refinement (faster) as a new method for protein structure optimization. Protein: Struct. Funct. Gen. 48, 31-43.
13. DUKKA, K., TOMITA, E., SUZUKI, J., AND AKUTSU, T. 2004. Protein side-chain packing problem: a maximum common edge-weight clique algorithmic approach. In Proceedings of the 2nd Asia Pacific Bioinformatics Conference. 191-200.
14. DUNBRACK JR., R. L. 1999. Comparative modeling of CASP3 targets using PSI-BLAST and SCWRL. Protein: Struct. Funct. Gen. 3, 81-87.
15. DUNBRACK JR., R. L., AND COHEN, F. 1997. Bayesian statistical analysis of protein side-chain rotamer preferences. Protein Sci. 6, 1661-1681.
16. ERIKSSON, O., ZHOU, Y., AND ELOFSSON, A. 2001. Side chain-positioning as an integer programming problem. In Proceedings of the 1st International Workshop on Algorithms in Bioinformatics. Springer-Verlag, New York, 128-141.
17. GOLDSTEIN, R. 1994. Efficient rotamer elimination applied to protein side-chains and related spin glasses. Biophys. J. 66, 1335-1340.
18. HOLM, L., AND SANDER, C. 1991. Database algorithm for generating protein backbone and sidechain coordinates from a ca trace: Application to model building and detection of coordinate errors. J. Mol. Biol. 218, 183-194.
19. JIANG, T., AND LI, M. 1995. On the approximation of shortest common supersequencesand longest common subsequences. SIAM J. Comput. 24, 5, 1122-1139.
20. JONES, D. 1999. GenTHREADER: An efficient and reliable protein fold recognition method for genomic sequences. J. Mol. Biol. 287, 797-815.
21. KELLEY, L., MACCALLUM, R., AND STERNBERG, M. 2000. Enhanced genome annotation using structural profiles in the program 3D-PSSM. J. Mol. Biol. 299, 2, 499-520.
22. KINGSFORD, C. L., CHAZELLE, B., AND SINGH, M. 2005. Solving and analyzing side-chain positioning problems using linear and integer programming. Bioinformatics 21, 1028-1036.
23. KOHLBACHER, O., AND LENHOF, H. 2000. BALL-Rapid software prototyping in computational molecular biology. Bioinformatics 16, 9, 815-824.
24. LEACH, A., AND LEMON, A. 1998. Exploring the conformational space of protein side chains using dead-end elimination and the A* algorithm. Protein: Struct. Funct. Gen. 33, 227-239.
25. LEE, C., AND SUBBIAH, S. 1991. Prediction of protein side-chain conformation by packing optimization. J. Mol. Biol. 217, 373-388.
26. LI, W., PIO, F., PAWLOWSKI, K., AND GODZIK, A. 2000. Saturated blast: Detecting distant homology using automated multiple intermediate sequence blast search. Bioinformatics 16, 1105-1110.
27. LIANG, S., AND GRISHIN, N. 2002. side-chain modelling with an optimized scoring function. Protein Sci. 11, 322-331.
28. MILLER, G. L., TENG, S., THURSTON, W., AND VAVASIS, S. A. 1997. Separators for sphere-packings and nearest neighbor graphs. J. ACM 44, 1, 1-29.
29. MOULT, J., FIDELIS, F., ZEMLA, A., AND HUBBARD, T. 2001. Critical assessment of methods on protein structure prediction (CASP)-round IV. Proteins: Struct. Funct. Gen. 45, S5 (Dec.), 2-7.
30. MOULT, J., FIDELIS, F., ZEMLA, A., AND HUBBARD, T. 2003. Critical assessment of methods on protein structure prediction (CASP)-round V. Proteins: Struct., Funct. Gen. 53, S6 (Oct.), 334-339.
31. MOULT, J., HUBBARD, T., FIDELIS, F., AND PEDERSEN, J. 1999. Critical assessment of methods on protein structure prediction (CASP)-round III. Proteins: Struct. Funct. Gen. 37, S3 (Dec.), 2-6.
32. MOUNT, D., AND ARYA, S. 1997. ANN: A library for approximate nearest neighbor searching. In Proceedings of the 2nd CGC Workshop on Computational Geometry.
33. PIERCE, N., AND WINFREE, E. 2002. Protein design is NP-hard. Protein Engi. 15, 10, 779-782.
34. ROBERTSON, N., AND SEYMOUR, P. 1986. Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms 7, 309-322.
35. SALI, A., AND BLUNDELL, T. 1993. Comparative protein modelling by satisfaction of spatial restraints. J. Mol. Biol., 779-815.
36. SAMUDRALA, R., AND MOULT, J. 1998. Determinants of side chain conformational preferences in protein structures. Protein Engi. 11, 991-997.
37. SHI, J., TOM, L. B., AND KENJI, M. 2001. FUGUE: Sequence-structure homology recognition using environment-specific substitution tables and structure-dependent gap penalties. J. Mol. Biol. 310, 243-257.
38. SUMMERS, N., AND KARPLUS, M. 1989. Construction of side-chains in homology modelling: Application to the c-terminal lobe of rhizopuspepsin. J. Mol. Biol. 210, 785-811.
39. VON OHSEN, N., SOMMER, I., ZIMMER, R., AND LENGAUER, T. 2004. Arby: automatic protein structure prediction using profile-profile alignment and confidence measures. Bioinformatics 20, 14 (Sept.), 2228-35.
40. XIANG, Z., AND HONIG, B. 2001. Extending the accuracy limits of prediction for side-chain conformations. J. Mol. Biol. 311, 421-430.
41. XU, J., LI, M., KIM, D., AND XU, Y. 2003a. RAPTOR: optimal protein threading by linear programming. Journal of Bioinformatics and Computational Biology 1, 1, 95-117.
42. XU, J., LI, M., LIN, G., KIM, D., AND XU, Y. 2003b. Protein threading by linear programming. In Biocomputing: Proceedings of the 2003 Pacific Symposium. Hawaii, USA, 264-275.
43. XU, Y., XU, D., AND UBERBACHER, E. 1998. An efficient computational method for globally optimal threadings. J. Comput. Biol. 5, 3, 597-614.