PMID- 22809385
OWN - NLM
STAT- MEDLINE
DCOM- 20121113
LR  - 20180810
IS  - 1757-6334 (Electronic)
IS  - 0219-7200 (Linking)
VI  - 10
IP  - 3
DP  - 2012 Jun
TI  - Exploiting symmetry properties of the discretizable molecular distance geometry 
      problem.
PG  - 1242009
LID - 10.1142/S0219720012420097 [doi]
AB  - 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 efficiently 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.
FAU - Mucherino, Antonio
AU  - Mucherino A
AD  - IRISA, University of Rennes 1, Rennes, France. antonio.mucherino@irisa.fr
FAU - Lavor, Carlile
AU  - Lavor C
FAU - Liberti, Leo
AU  - Liberti L
LA  - eng
PT  - Journal Article
PT  - Research Support, Non-U.S. Gov't
PL  - Singapore
TA  - J Bioinform Comput Biol
JT  - Journal of bioinformatics and computational biology
JID - 101187344
RN  - 0 (Proteins)
SB  - IM
MH  - *Algorithms
MH  - Models, Molecular
MH  - Proteins/*chemistry
EDAT- 2012/07/20 06:00
MHDA- 2012/11/14 06:00
CRDT- 2012/07/20 06:00
PHST- 2012/07/20 06:00 [entrez]
PHST- 2012/07/20 06:00 [pubmed]
PHST- 2012/11/14 06:00 [medline]
AID - 10.1142/S0219720012420097 [doi]
PST - ppublish
SO  - J Bioinform Comput Biol. 2012 Jun;10(3):1242009. doi: 10.1142/S0219720012420097.