Rapid protein side-chain packing via tree decomposition

Lecture Notes in Bioinformatics (Subseries of Lecture Notes in Computer Science)

Volumn 3500, Issue , 2005, Pages 423-439

  Xu, Jinbo ^a,b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECOMPOSITION; MOLECULAR BIOLOGY; OPTIMIZATION; GRAPH THEORY; OPERATIONS RESEARCH; PROBLEM SOLVING; TREES (MATHEMATICS);

MINIMIZATION ALGORITHM; SIDE-CHAIN ASSIGNMENT ALGORITHM; RESIDUE INTERACTION GRAPH; ROTAMERS; SIDE-CHAIN PACKING PROBLEM; TREE DECOMPOSITION;

PROTEINS;

EID: 26444462147     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11415770_32     Document Type: Conference Paper

References (45)

1. Rost, B.: TOPITS: Threading one-dimensional predictions into three-dimensional structures. In Rawlings, C., Clark, D., Altman, R., Hunter, L., Lengauer, T., Wodak, S., eds.: Third International Conference on Intelligent Systems for Molecular Biology, Cambridge, England, AAAI Press (1995) 314-321
2. Xu, Y., Xu, D., Uberbacher, E.: An efficient computational method for globally optimal threadings. Journal of Computational Biology 5 (1998) 597-614
3. Kim, D., Xu, D., Guo, J., Ellrott, K., Xu, Y.: PROSPECT II: Protein structure prediction method for genome-scale applications. Protein Engineering 16 (2003) 641-650
4. Jones, D.: GenTHREADER: An efficient and reliable protein fold recognition method for genomic sequences. Journal of Molecular Biology 287 (1999) 797-815
5. Kelley, L., MacCallum, R., Sternberg, M.: Enhanced genome annotation using structural profiles in the program 3D-PSSM. Journal of Molecular Biology 299 (2000) 499-520
6. Alexandrov, N., Nussinov, R., Zimmer, R.: Fast protein fold recognition via sequence to structure alignment and contact capacity potentials. In: Biocomputing: Proceedings of 1996 Pacific Symposium. (1996)
7. von Ohsen, N., Sommer, L, Zimmer, R., Lengauer, T.: Arby: automatic protein structure prediction using profile-profile alignment and confidence measures. Bioinformatics 20 (2004) 2228-35
8. Shi, J., Tom, L.B., Kenji, M.: FUGUE: Sequence-structure homology recognition using environment-specific substitution tables and structure-dependent gap penalties. Journal of Molecular Biology 310 (2001) 243-257
9. Lathrop, R., Smith, T.: A branch-and-bound algorithm for optimal protein threading with pairwise (contact potential) amino acid interactions. In: Proceedings of the 27th Hawaii International Conference on System Sciences, IEEE Computer Society Press (1994)
10. Akutsu, T., Miyano, S.: On the approximation of protein threading. Theoretical Computer Science 210 (1999) 261-275
11. Li, W., Pio, F., Pawlowski, K., Godzik, A.: Saturated BLAST: detecting distant homology using automated multiple intermediate sequence BLAST search. Bioinformatics 16 (2000) 1105-1110
12. Summers, N., Karplus, M.: Construction of side-chains in homology modelling: Application to the c-terminal lobe of rhizopuspepsin. Journal of Molecular Biology 210 (1989) 785-811
13. α trace: Application to model building and detection of coordinate errors. Journal of Molecular Biology 218 (1991) 183-194
14. Desmet, J., Maeyer, M.D., Hazes, B., Laster, I.: The dead-end elimination theorem and its use in protein side-chain positioning. Nature 356 (1992) 539-542
15. Desmet, J., Spriet, J., Laster, I.: Fast and accurate side-chain topology and energy refinement (faster) as a new method for protein structure optimization. Protein: Structure, Function and Genetics 48 (2002) 31-43
16. Jr., R.D.: Comparative modeling of CASP3 targets using PSI-BLAST and SCWRL. Protein: Structure, Function and Genetics 3 (1999) 81-87
17. Canutescu, A., Shelenkov, A., Jr., R.D.: A graph-theory algorithm for rapid protein side-chain prediction. Protein Science 12 (2003) 2001-2014
18. Samudrala, R., Moult, J.: Determinants of side chain conformational preferences in protein structures. Protein Engineering 11 (1998) 991-997
19. Xiang, Z., Honig, B.: Extending the accuracy limits of prediction for side-chain conformations. Journal of Molecular Biology 311 (2001) 421-430
20. Bower, M., Cohen, F., Jr., R.D.: Prediction of protein side-chain rotamers from a backbone-dependent rotamer library: A new homology modeling tool. Journal of Molecular Biology 267 (1997) 1268-1282
21. Liang, S., Grishin, N.: side-chain modelling with an optimized scoring function. Protein Science 11 (2002) 322-331
22. Hong, E., Lozano-Perez, T.: Protein side-chain placement: probabilistic inference and integer programming methods. Technical report, Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology (2004)
23. Chazelle, B., Kingsford, C., Singh, M.: A semidefinite programming approach to side-chain positioning with new rounding strategies. Informs Journal on Computing, Special Issue in Computational Molecular Biology/Bioinformatics (2004) 86-94
24. Kingsford, C.L., Chazelle, B., Singh, M.: Solving and analyzing side-chain positioning problems using linear and integer programming. Bioinformatics (2004)
25. Eriksson, O., Zhou, Y., Elofsson, A.: Side chain-positioning as an integer programming problem. In: Proceedings of the First International Workshop on Algorithms in Bioinformatics, Springer-Verlag (2001) 128-141
26. Dukka, K., Tomita, E., Suzuki, J., Akutsu, T.: Protein side-chain packing problem: a maximum common edge-weight clique algorithmic approach. In: The Second Asia Pacific Bioinformatics Conference. (2004)
27. Althaus, E., Kohlbacher, O., Lenhof, H., Müller, P.: A branch and cut algorithm for the optimal solution of the side-chain placement problem. Technical Report MPI-I-2000-1-001, Max-Planck-Institute für Informatik (2000)
28. Jr., R.D., Karplus, M.: Backbone-dependent rotamer library for proteins: Application to side-chain prediction. Journal of Molecular Biology 230 (1993) 543-574
29. Pierce, N., Winfree, E.: Protein design is NP-hard. Protein Engineering 15 (2002) 779-782
30. Akutsu, T.: NP-hardness results for protein side-chain packing. In Miyano, S., Takagi, T., eds.: Genome Informatics 8. (1997) 180-186
31. Sali, A., Blundell, T.: Comparative protein modelling by satisfaction of spatial restraints. Journal of Molecular Biology (1993) 779-815
32. Leach, A., Lemon, A.: Exploring the conformational space of protein side chains using dead-end elimination and the A* algorithm. Protein: Structure, Function and Genetics 33 (1998) 227-239
33. Goldstein, R.: Efficient rotamer elimination applied to protein side-chains and related spin glasses. Biophysical Journal 66 (1994) 1335-1340
34. Robertson, N., Seymour, P.: Graph minors. II. algorithmic aspects of tree-width. Journal of Algorithms 7 (1986) 309-322
35. Koster, A., van Hoesel, S., Kolen, A.: Solving frequency assignment problems via tree-decomposition. Research Memoranda 036, Maastricht: METEOR, Maastricht Research School of Economics of Technology and Organization (1999) available at http://ideas.repec.org/p/dgr/umamet/1999036.html.
36. Bach, F., Jordan, M.: Thin junction trees. In Dietterich, T., Becker, S., Ghahramani, Z., eds.: Advances in Neural Information Processing Systems (NIPS). Volume 14. (2002)
37. Arnborg, S., Corneil, D., Proskurowski, A.: Complexity of finding embedding in a k-tree. SIAM Journal on Algebraic and Discrete Methods 8 (1987) 277-284
38. Miller, G.L., Teng, S., Thurston, W., Vavasis, S.A.: Separators for sphere-packings and nearest neighbor graphs. Journal of ACM 44 (1997) 1-29
39. Berry, A., Heggernes, P., Simonet, G.: The minimum degree heuristic and the minimal triangulation process. Volume 2880., Proceedings WG 2003 - 29th Workshop on Graph Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, Springer Verlag (2003) 58-70
40. Kohlbacher, O., Lenhof, H.: BALL - rapid software prototyping in computational molecular biology. Bioinformatics 16 (2000) 815C824
41. Arya, S., Mount, D., Netanyahu, N., Silverman, R., Wu, A.: An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. Journal of ACM 45 (1998) 891-923
42. Mount, D., Arya, S.: ANN: a library for approximate nearest neighbor searching. In: 2nd CGC Workshop on Computational Geometry. (1997)
43. Amir, E.: Efficient approximation for triangulation of minimum treewdith. In: 17th Conference on Uncertainty in Artificial Intelligence (UAI '01). (2001)
44. Xu, J., Li, M., Lin, G., Kim, D., Xu, Y.: Protein threading by linear programming. In: Biocomputing: Proceedings of the 2003 Pacific Symposium, Hawaii, USA (2003) 264-275
45. Xu, J., Li, M., Kim, D., Xu, Y.: RAPTOR: optimal protein threading by linear programming. Journal of Bioinformatics and Computational Biology 1 (2003) 95-117