Solving the discretizable molecular distance geometry problem by multiple realization trees

Distance Geometry: Theory, Methods, and Applications

Volumn 9781461451280, Issue , 2013, Pages 161-176

  Nucci, Pedro ^a   Nogueira, Loana Tito ^b   Lavor, Carlile ^c  

^a Marinha do Brasil   (Brazil)

^b FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

^c UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

Branch and prune; Distance geometry; Realization tree

Indexed keywords

GEOMETRY; TREES (MATHEMATICS);

BRANCH AND PRUNES; BRANCH-AND-PRUNE ALGORITHMS; DISCRETE ALGORITHMS; DISTANCE GEOMETRY; MOLECULAR DISTANCE GEOMETRY PROBLEM; REALIZATION TREE; SEARCH SPACES;

FORESTRY;

EID: 84893842842     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-1-4614-5128-0_9     Document Type: Chapter

References (11)

1. Berman, H.M., Westbrook, J., Feng, Z., Gilliland, G., Bhat, T.N., Weissig, H., Shindyalov, I.N., Bourne, P.E.: The protein data bank. Nucleic Acids Res. 28, 235-242 (2000)
2. Crippen, G., Havel, T.: Distance Geometry and Molecular Conformation. Wiley, New York (1988)
3. Dong, Q., Wu, Z.: A linear-time algorithm for solving the molecular distance geometry problem with exact interatomic distances. J. Global Optim. 22, 365-375 (2002)
4. Lavor, C., Liberti, L., Maculan, N.: Molecular distance geometry problem. Encyclopedia of Optimization, pp. 2305-2311, 2nd edn. Springer, New York (2009)
5. Lavor, C., Liberti, L., Maculan, N., Mucherino, A.: The discretizable molecular distance geometry problem. Comput. Optim. Appl. 52, 115-146 (2012)
6. Lavor, C., Liberti, L., Maculan, N., Mucherino, A.: Recent advances on the discretizable molecular distance geometry problem. Eur. J. Oper. Res. 219, 698-706 (2012)
7. Liberti, L., Lavor, C., Maculan, N.: A branch-and-prune algorithm for the molecular distance geometry problem. Int. Trans. Oper. Res. 15, 1-17 (2008)
8. Liberti, L., Lavor, C., Mucherino, A., Maculan, N.: Molecular distance geometry methods: from continuous to discrete. Int. Trans. Oper. Res. 18, 33-51 (2010)
9. Mucherino, A., Lavor, C., Liberti, L., Talbi, E.-G.: A parallel version of the branch and prune algorithm for the molecular distance geometry problem. In: IEEE Conference Proceedings, ACS/IEEE International Conference on Computer Systems and Applications (AICCSA10), pp. 1-6. Hammamet, Tunisia (2010)
10. Nucci, P.: Heuristicas para o problema molecular de geometria de distancias aplicado a proteinas. Undergraduate Dissertation, Fluminense Federal University
11. Saxe, J.B.: Embeddability of weighted graphs in k-space is strongly NP-hard. In: Proceedings of 17th Allerton Conference in Communications, Control and Computing, pp. 480-489. Monticello, IL (1979).