Please use this identifier to cite or link to this item:
|Type:||Artigo de evento|
|Title:||On The Number Of Solutions Of The Discretizable Molecular Distance Geometry Problem|
|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.|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.