Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/74923
Type: Artigo de periódico
Title: The discretizable molecular distance geometry problem
Author: Lavor, C
Liberti, L
Maculan, N
Mucherino, A
Abstract: Given a simple weighted undirected graph G=(V,E,d) with d:E -> a"e(+), the Molecular Distance Geometry Problem (MDGP) consists in finding an embedding x:V -> a"e(3) such that aEuro-x (u) -x (v) aEuro-=d (uv) for each {u,v}aE. We show that under a few assumptions usually satisfied in proteins, the MDGP can be formulated as a search in a discrete space. We call this MDGP subclass the Discretizable MDGP (DMDGP). We show that the DMDGP is NP-hard and we propose a solution algorithm called Branch-and-Prune (BP). The BP algorithm performs remarkably well in practice in terms of speed and solution accuracy, and can be easily modified to find all incongruent solutions to a given DMDGP instance. We show computational results on several artificial and real-life instances.
Subject: Distance geometry
Branch-and-prune
Molecular conformation
Protein
NMR
Country: EUA
Editor: Springer
Rights: fechado
Identifier DOI: 10.1007/s10589-011-9402-6
Date Issue: 2012
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
WOS000304696600006.pdf1.15 MBAdobe PDFView/Open


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