Produção Nacional
Revisado por pares
Molecular distance geometry methods: from continuous to discrete
2010; Wiley; Volume: 18; Issue: 1 Linguagem: Inglês
10.1111/j.1475-3995.2009.00757.x
ISSN1475-3995
AutoresLeo Liberti, Carlile Lavor, Antonio Mucherino, Nelson Maculan,
Tópico(s)Analytical Chemistry and Chromatography
ResumoInternational Transactions in Operational ResearchVolume 18, Issue 1 p. 33-51 Molecular distance geometry methods: from continuous to discrete Leo Liberti, Leo Liberti LIX, École Polytechnique, F-91128 Palaiseau, FranceEmails: liberti@lix.polytechnique.fr; mucherino@lix.polytechnique.frSearch for more papers by this authorCarlile Lavor, Carlile Lavor Department of Applied Mathematics (IMECC-UNICAMP), State University of Campinas, C.P. 6065, 13081-970, Campinas – SP, BrazilEmail: clavor@ime.unicamp.brSearch for more papers by this authorAntonio Mucherino, Antonio Mucherino LIX, École Polytechnique, F-91128 Palaiseau, FranceEmails: liberti@lix.polytechnique.fr; mucherino@lix.polytechnique.frSearch for more papers by this authorNelson Maculan, Nelson Maculan Federal University of Rio de Janeiro (COPPE–UFRJ), C.P. 68511, 21945-970, Rio de Janeiro – RJ, BrazilEmail: maculan@cos.ufrj.brSearch for more papers by this author Leo Liberti, Leo Liberti LIX, École Polytechnique, F-91128 Palaiseau, FranceEmails: liberti@lix.polytechnique.fr; mucherino@lix.polytechnique.frSearch for more papers by this authorCarlile Lavor, Carlile Lavor Department of Applied Mathematics (IMECC-UNICAMP), State University of Campinas, C.P. 6065, 13081-970, Campinas – SP, BrazilEmail: clavor@ime.unicamp.brSearch for more papers by this authorAntonio Mucherino, Antonio Mucherino LIX, École Polytechnique, F-91128 Palaiseau, FranceEmails: liberti@lix.polytechnique.fr; mucherino@lix.polytechnique.frSearch for more papers by this authorNelson Maculan, Nelson Maculan Federal University of Rio de Janeiro (COPPE–UFRJ), C.P. 68511, 21945-970, Rio de Janeiro – RJ, BrazilEmail: maculan@cos.ufrj.brSearch for more papers by this author First published: 19 August 2010 https://doi.org/10.1111/j.1475-3995.2009.00757.xCitations: 81Read the full textAboutPDF ToolsRequest permissionExport citationAdd to favoritesTrack citation ShareShare Give accessShare full text accessShare full-text accessPlease review our Terms and Conditions of Use and check box below to share full-text version of article.I have read and accept the Wiley Online Library Terms and Conditions of UseShareable LinkUse the link below to share a full-text version of this article with your friends and colleagues. Learn more.Copy URL Share a linkShare onFacebookTwitterLinked InRedditWechat Abstract Distance geometry problems (DGP) arise from the need to position entities in the Euclidean K-space given some of their respective distances. Entities may be atoms (molecular distance geometry), wireless sensors (sensor network localization), or abstract vertices of a graph (graph drawing). In the context of molecular distance geometry, the distances are usually known because of chemical properties and nuclear magnetic resonance experiments; sensor networks can estimate their relative distance by recording the power loss during a two-way exchange; finally, when drawing graphs in two or three dimensions, the graph to be drawn is given, and therefore distances between vertices can be computed. DGPs involve a search in a continuous Euclidean space, but sometimes the problem structure helps reduce the search to a discrete set of points. In this paper we survey some continuous and discrete methods for solving some problems of molecular distance geometry. Citing Literature Volume18, Issue1January 2011Pages 33-51 RelatedInformation
Referência(s)