On a discretizable subclass of instances of the molecular distance geometry problem

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2009, Pages 804-805

  Lavor, Carlile ^a   Liberti, Leo ^b   Mucherino, Antonio ^b   Maculan, Nelson ^c  

^a UNIVERSITY OF CAMPINAS   (Brazil)

^b ÉCOLE POLYTECHNIQUE   (France)

^c FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Combinatorialization; Distance geometry; Protein backbone; Protein molecules; Undirected weighted graph

Indexed keywords

GEOMETRY; GLOBAL OPTIMIZATION; GRAPHIC METHODS; PROTEINS;

COMBINATORIALIZATION; DISTANCE GEOMETRY; PROTEIN BACKBONE; PROTEIN MOLECULES; UNDIRECTED WEIGHTED GRAPHS;

COMBINATORIAL MATHEMATICS;

EID: 72949109097     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1529282.1529451     Document Type: Conference Paper

References (5)

1. C. Lavor, On Generating Instances for the Molecular Distance Geometry Problem, In: L. Liberti and N. Maculan (Eds.), Global Optimization: from Theory to Implementation, Springer, New York, 405-414, 2006.
2. C. Lavor, L. Liberti, and N. Maculan, Computational Experience with the Molecular Distance Geometry Problem, In: Global Optimization: Scientific and Engineering Case Studies, J. Pintér (Ed.), 213-225. Springer, Berlin, 2006.
3. nd edition, Springer, New York, 2305-2311, 2009.
4. L. Liberti, C. Lavor, and N. Maculan, A Branch-and-Prune Algorithm for the Molecular Distance Geometry Problem, International Transactions in Operational Research 15 (1): 1-17, 2008.
5. L. Liberti, C. Lavor, and N. Maculan, Discretizable Molecular Distance Geometry Problem, Tech. Rep. q-bio.BM/0608012, arXiv, 2006.