Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/108756
Type: Artigo de evento
Title: On The Number Of Solutions Of The Discretizable Molecular Distance Geometry Problem
Author: Liberti L.
Masson B.
Lee J.
Lavor C.
Mucherino A.
Abstract: The Discretizable Molecular Distance Geometry Problem is a subset of instances of the distance geometry problem that can be solved by a combinatorial algorithm called "Branch-and-Prune". It was observed empirically that the number of solutions of YES instances is always a power of two. We perform an extensive theoretical analysis of the number of solutions for these instances and we prove that this number is a power of two with probability one. © 2011 Springer-Verlag.
Editor: 
Rights: fechado
Identifier DOI: 10.1007/978-3-642-22616-8_26
Address: http://www.scopus.com/inward/record.url?eid=2-s2.0-80051984860&partnerID=40&md5=beb8bdbbeb8e8e335050d63261892eb4
Date Issue: 2011
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File SizeFormat 
2-s2.0-80051984860.pdf390.52 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.