Skip to Main content Skip to Navigation
Journal articles

The interval Branch & Prune Algorithm for the Discretizable Molecular Distance Geometry Problem with Inexact Distances

Carlile Lavor 1 Leo Liberti 2 Antonio Mucherino 3
1 IMECC - Instituto de Matemática, Estatística e Computação Científica [Brésil]
2 X - École polytechnique
3 GenScale - Scalable, Optimized and Parallel Algorithms for Genomics
Inria Rennes – Bretagne Atlantique , IRISA-D7 - GESTION DES DONNÉES ET DE LA CONNAISSANCE
Document type :
Journal articles
Complete list of metadatas
https://hal.inria.fr/hal-00912660
Contributor : Antonio Mucherino <>
Submitted on : Monday, December 2, 2013 - 2:46:05 PM
Last modification on : Friday, July 10, 2020 - 4:19:03 PM

Identifiers

  • HAL Id : hal-00912660, version 1

Collections

UNIV-RENNES1 | CNRS | INRIA | IRISA | IRISA-D7 | UR1-UFR-ISTIC | UNIV-RENNES | X | INSTITUT-TELECOM | INSA-RENNES

Citation

Carlile Lavor, Leo Liberti, Antonio Mucherino. The interval Branch & Prune Algorithm for the Discretizable Molecular Distance Geometry Problem with Inexact Distances. Journal of Global Optimization, Springer Verlag, 2013, 56 (3), pp.855-871. ⟨hal-00912660⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

620

 

Contact                    Legal Notice                    Personal Data