A discrete search algorithm for finding the structure of protein backbones and side chains

International Journal of Bioinformatics Research and Applications

Volumn 9, Issue 3, 2013, Pages 261-270

  Sallaume, Silas ^a   De Lima Martins, Simone ^b   Ochi, Luiz Satoru ^b   Da Silva, Warley Gramacho ^c   Lavor, Carlile ^d   Liberti, Leo ^e  

^a Centro Universitário Euripedes de Marília   (Brazil)

^b FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

^c UNIVERSIDADE FEDERAL DO TOCANTINS   (Brazil)

^d UNIVERSITY OF CAMPINAS   (Brazil)

^e ECOLE POLYTECHNIQUE   (France)

Author keywords

Algorithms; Bioinformatics; Computational Physical Chemistry; Discretisable Molecular Distance Geometry Problem; Protein Structure

Indexed keywords

EID: 84877294741     PISSN: 17445485     EISSN: 17445493     Source Type: Journal    
DOI: 10.1504/IJBRA.2013.053606     Document Type: Article

References (16)

1. Berman, H.M., Westbrook, J., Feng, Z., Gilliland, G., Bhat, T.N., Weissig, H., Shindyalov, I.N., and Bourne, P.E. (2000) 'The Protein Data Bank', Nucleic Acids Research, Vol. 28, pp.235-242.
2. Biswas, P., Toh, K.C. and Ye, Y. (2008) 'A distributed SDP approach for large-scale noisy anchor-free graph realization with applications to molecular conformation', SIAM Journal on Scientific Computing, Vol. 30, pp.1251-1277.
3. Carvalho, R.S., Lavor, C. and Protti, F. (2008) 'Extending the geometric buildup algorithm for the molecular distance geometry problem', Information Processing Letters, Vol. 108, pp.234-237.
4. Creighton, T. (1993) Proteins: Structures and Molecular Properties, 2nd ed., W.H. Freeman, New York.
5. Dong, Q. and Wu, Z. (2002) 'A linear-time algorithm for solving the molecular distance geometry problem with exact interatomic distances', Journal of Global Optimization, Vol. 22, pp.365-375.
6. Lavor, C., Lee, J., Lee-St John, A., Liberti, L., Mucherino, A. and Sviridenko, M. (2010) 'Discretization orders for distance geometry problems', Optimization Letters, DOI: 10.1007/s11590-011-0302-6.
7. Lavor, C., Liberti, L. and Maculan, N. (2006) The Discretizable Molecular Distance Geometry Problem, arXiv:q-bio/0608012v1.
8. Lavor, C., Liberti, L. and Maculan, N. (2009) Molecular Distance Geometry Problem, Encyclopedia of Optimization, 2nd ed., Springer, New York, pp.2305-2311.
9. Lavor, C., Liberti, L., Maculan, N. and Mucherino, A. (2011) 'Recent advances on the discretizable molecular distance geometry problem', European Journal of Operational Research, DOI: 10.1016/j.ejor.2011.11.007.
10. Lavor, C., Liberti, L., Maculan, N. and Mucherino, A. (2012) 'The discretizable molecular distance geometry problem', Computational Optimization and Applications, DOI: 10.1007/s 10589-011-9402-6.
11. Liberti, L., Lavor, C. and Maculan, N. (2008) 'A branch-and-prune algorithm for the molecular distance geometry problem', International Transactions in Operational Research, Vol. 15, pp.1-17.
12. Liberti, L., Lavor, C. and Maculan, N. (2011) 'Molecular distance geometry methods: from continuous to discrete', International Transactions in Operational Research, Vol. 18, pp.33-51.
13. Saxe, J.B. (1979) 'Embeddability of weighted graphs in k-space is strongly NP-hard', Proceedings of 17th Allerton Conference in Communications, Control and Computing, Monticello, IL, pp.480-489.
14. Schlick, T. (2002) Molecular Modeling and Simulation: An Interdisciplinary Guide, Springer, New York.
15. Wu, D. and Wu, Z. (2007) 'An updated geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data', Journal of Global Optimization, Vol. 37, pp.661-673.
16. Wu, D., Wu, Z. and Yuan, Y. (2008) 'Rigid versus unique determination of protein structures with geometric buildup', Optimization Letters, Vol. 2, pp.319-331.