Recent advances on the Discretizable Molecular Distance Geometry Problem

dc.creatorLavor, C
dc.creatorLiberti, L
dc.creatorMaculan, N
dc.creatorMucherino, A
dc.date2012
dc.date42522
dc.date2014-08-01T18:33:11Z
dc.date2015-11-26T17:04:04Z
dc.date2014-08-01T18:33:11Z
dc.date2015-11-26T17:04:04Z
dc.date.accessioned2018-03-28T23:52:18Z
dc.date.available2018-03-28T23:52:18Z
dc.identifierEuropean Journal Of Operational Research. Elsevier Science Bv, v. 219, n. 3, n. 698, n. 706, 2012.
dc.identifier0377-2217
dc.identifierWOS:000302199300021
dc.identifier10.1016/j.ejor.2011.11.007
dc.identifierhttp://www.repositorio.unicamp.br/jspui/handle/REPOSIP/80615
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/80615
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1279257
dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.descriptionThe Molecular Distance Geometry Problem (MDGP) consists in finding an embedding in R-3 of a nonnegatively weighted simple undirected graph with the property that the Euclidean distances between embedded adjacent vertices must be the same as the corresponding edge weights. The Discretizable Molecular Distance Geometry Problem (DMDGP) is a particular subset of the MDGP which can be solved using a discrete search occurring in continuous space: its main application is to find three-dimensional arrangements of proteins using Nuclear Magnetic Resonance (NMR) data. The model provided by the DMDGP, however, is too abstract to be directly applicable in proteomics. In the last five years our efforts have been directed towards adapting the DMDGP to be an ever closer model of the actual difficulties posed by the problem of determining protein structures from NMR data. This survey lists recent developments on DMDGP related research. (C) 2011 Elsevier B.V. All rights reserved.
dc.description219
dc.description3
dc.description698
dc.description706
dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.descriptionCNRS
dc.descriptionANR
dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.languageen
dc.publisherElsevier Science Bv
dc.publisherAmsterdam
dc.publisherHolanda
dc.relationEuropean Journal Of Operational Research
dc.relationEur. J. Oper. Res.
dc.rightsfechado
dc.rightshttp://www.elsevier.com/about/open-access/open-access-policies/article-posting-policy
dc.sourceWeb of Science
dc.subjectGraph theory
dc.subjectBioinformatics
dc.subjectProtein conformation
dc.subjectBranch-and-prune
dc.subjectBuildup Algorithm
dc.titleRecent advances on the Discretizable Molecular Distance Geometry Problem
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución