Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||EXPLOITING SYMMETRY PROPERTIES OF THE DISCRETIZABLE MOLECULAR DISTANCE GEOMETRY PROBLEM|
|Abstract:||The Discretizable Molecular Distance Geometry Problem (DMDGP) involves a subset of instances of the distance geometry problem for which some assumptions allowing for discretization are satisfied. The search domain for the DMDGP is a binary tree that can be effciently explored by employing a Branch & Prune (BP) algorithm. We showed in recent works that this binary tree may contain several symmetries, which are directly related to the total number of solutions of DMDGP instances. In this paper, we study the possibility of exploiting these symmetries for speeding up the solution of DMDGPs, and propose an extension of the BP algorithm that we named symmetry-driven BP (symBP). Computational experiments on artificial and protein instances are presented.|
|Editor:||Imperial College Press|
|Citation:||Journal Of Bioinformatics And Computational Biology. Imperial College Press, v. 10, n. 3, 2012.|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.