@inproceedings{a716936b3cbe460381ef2140dde48a91,
title = "On a discretizable subclass of instances of the molecular distance geometry problem",
abstract = "The molecular distance geometry problem can be formulated as the problem of finding an immersion in R3 of a given undirected, nonnegatively weighted graph G. In this paper, we discuss a set of graphs G for which the problem may also be formulated as a combinatorial search in discrete space. This is theoretically interesting as an example of {"}combinatorialization{"} of a continuous nonlinear problem. It is also algorithmically interesting because the natural combinatorial solution algorithm performs much better than a global optimization approach on the continuous formulation. We present a Branch and Prune algorithm which can be used for obtaining a set of positions of the atoms of protein conformations when only some of the distances between the atoms are known.",
keywords = "Combinatorialization, Distance geometry, Protein backbone, Protein molecules, Undirected weighted graph",
author = "Carlile Lavor and Leo Liberti and Antonio Mucherino and Nelson Maculan",
year = "2009",
month = jan,
day = "1",
doi = "10.1145/1529282.1529451",
language = "English",
isbn = "9781605581668",
series = "Proceedings of the ACM Symposium on Applied Computing",
publisher = "Association for Computing Machinery (ACM)",
pages = "804--805",
booktitle = "24th Annual ACM Symposium on Applied Computing, SAC 2009",
note = "24th Annual ACM Symposium on Applied Computing, SAC 2009 ; Conference date: 08-03-2009 Through 12-03-2009",
}