Constant time clash detection in protein folding

Journal of Bioinformatics and Computational Biology

Volumn 7, Issue 1, 2009, Pages 55-74

  Bugalho, Miguel M F ^a   Oliveira, Arlindo L ^a  

^a INESC ID   (Portugal)

Author keywords

Ab initio protein folding; Clash detection; Protein folding

Indexed keywords

PROTEIN;

AB INITIO CALCULATION; ALGORITHM; ARTICLE; CHEMICAL STRUCTURE; MOLECULAR DOCKING; PREDICTION; PROTEIN FOLDING; PROTEIN STRUCTURE; TIME;

COMPUTER SIMULATION; CRYSTALLOGRAPHY; MODELS, CHEMICAL; MODELS, MOLECULAR; PROTEIN CONFORMATION; PROTEIN FOLDING; PROTEINS; TIME FACTORS;

EID: 65449173167     PISSN: 02197200     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0219720009003996     Document Type: Article

References (36)

1. Smith GR, Sternberg MJ, Prediction of protein-protein interactions by docking methods, Curr Opin Struct Biol 12(1):28-35, 2002.
2. Halperin I, Ma B, Wolfson H, Nussinov R, Principles of docking: An overview of search algorithms and a guide to scoring functions, Proteins 47:409-443, 2002.
3. Jones S, Thornton JM, Principles of protein-protein interactions, Proc Natl Acad Sci USA 93(1):13-20, 1996.
4. Pettersen EF, Goddard TD, Huang CC, Couch GS, Greenblatt DM, Meng EC, Ferrin TE, UCSF ChimeraA visualization system for exploratory research and analysis, J Comput Chem 25(13): 1605-1612, 2004.
5. DeLano WL, The PyMOL molecular graphics system, 2002.
6. Dill KA, Principles of protein folding - A perspective from simple exact models, Protein Science 4(4):561-602, 1995.
7. Fraenkel AS, Complexity of protein folding, Bull Math Biol 55 (6):1199-1210, 1993.
8. Crescenzi P, Goldman D, Papadimitriou CH, Piccolboni A, Yannakakis M, On the complexity of protein folding, J Comput Biol 5 (3):423-466, 1998.
9. Berger B, Leighton T, Protein folding in the hydrophobic-hydrophilic (HP) is NP-complete, Proc 2nd Annu Int Conf Comput Mol Biol, pp. 30-39, 1998.
10. Hart WE, Istrail S, Robust proofs of NP-hardness for protein folding: General lattices and energy potentials, J Comput Biol 4 (1):1-22, 1997.
11. Bonneau R, Tsai J, Ruczinski I et al., Rosetta in CASP 4: Progress in ab-initio protein structure prediction, Proteins Structure Function and Genetics 45(s5):119-126, 2001.
12. Bonneau R, Strauss CE, Rohl CA et al., De novo prediction of three-dimensional structures for major protein families, J Mol Biol 322(1):65-78, 2002.
13. Nigham A, Hsu D, Latombe JC, Characterizing protein conformation space, DSpace♂IT, 2007.
14. Wu S, Skolnick J, Zhang Y, Ab-initio modeling of small proteins by iterative TASSER simulations, BMC Biology 5:17, 2007.
15. Fernandez-Fuentes N, Oliva B, Fiser A, A supersecondary structure library and search algorithm for modeling loops in protein structures, Nucleic Acids Res 34(7):2085, 2006.
16. Offman MN, Fitzjohn PW, Bates PA, Developing a move-set for protein model refinement, Bioinformatics 22(15):1838, 2006.
17. Chávez E, Navarro G, Baeza-Yates R, Marroquín JL, Searching in metric spaces, ACM Computing Surveys 33 (3):273-321, 2001.
18. Andoni A, Indyk P, Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions, Proc 47th Annu IEEE Symp Foundations of Computer Science (FOCS'06), pp. 459-468, 2006.
19. Wang J, Cieplak P, Kollman PA, How well does a restrained electrostatic potential (RESP) model perform in calculating conformational energies of organic and biological molecules? J Comput Chem 21 (12):1049-1074, 2000.
20. Cornell WD, Cieplak P, Bayly CI et al., A second generation force field for the simulation of proteins, nucleic acids, and organic molecules, J Am Chem Soc 117(19):5179-5197, 1995.
21. Ciaccia P, Patella M, Zezula P, M-tree: An efficient access method for similarity search in metric spaces, Proc 23rd Int Conf Very Large Data Bases, pp. 426-435, 1997.
22. Traina Jr C, Traina A, Faloutsos C, Seeger B, Fast indexing and visualization of metric data sets using slim-trees, IEEE Transactions on Knowledge and Data Engineering 14(2):244-260, 2002.
23. Beckmann N, Kriegel HP, Schneider R, Seeger B, The R*-tree: An efficient and robust access method for points and rectangles, ACM SIGMOD Record 19(2):322-331, 1990.
24. Navarro G, Searching in metric spaces by spatial approximation, The International Journal on Very Large Data Bases 11(1):28-46, 2002.
25. Navarro G, Reyes N, Fully dynamic spatial approximation trees, Proc 9th Int Symp String Processing Information Retrieval (SPIRE 2002), pp. 254-270, 2002.
26. Hooft RWW, Sander C, Vriend G, Verification of protein structures: Side-chain planarity, J Appl Crystallogr 29(6):714-716, 1996.
27. http://swift.cmbi.kun.nl/whatif/select/.
28. Boberg J, Salakoski T, Vihinen M, Selection of a representative set of structures from Brookhaven Protein Data Bank, Proteins 14 (2):265-276, 1992.
29. Hobohm U, Sander C, Enlarged representative set of protein structures, Protein Science 3(3):522, 1994.
30. Berman HM, Westbrook J, Feng Z, Gilliland G, Bhat TN, Weissig H, Shindyalov IN, Bourne PE, The Protein Data Bank, Nucleic Acids Res 28(1):235-242, 2000.
31. http://www.rcsb.org/.
32. Park BH, Levitt M, The complexity and accuracy of discrete state models of protein structure, J Mol Biol 249:493-507, 1995.
33. Dunbrack RL, Karplus M, Conformational analysis of the backbone-dependent rotamer preferences of protein sidechains, Nat Struct Biol 1(5):334-340, 1994.
34. Dunbrack Jr RL, Rotamer libraries in the 21st century, Curr Opin Struct Biol 12(4):431-440, 2002.
35. Dunbrack Jr RL, Cohen FE, Bayesian statistical analysis of protein side-chain rotamer preferences, Protein Science 6 (8):1661-1681, 1997.
36. Dunbrack Jr RL, Karplus M, Backbone-dependent rotamer library for proteins, Application to side-chain prediction, J Mol Biol 230 (2):543-574, 1993.