Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||Molecular distance geometry methods: from continuous to discrete|
|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.|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.