Distance geometry [Documento electrónico] : theory, methods, and applications / edited by Antonio Mucherino ...[et al.]
Language: eng.Country: US - United States of America.Publication: New York, NY : Springer , 2013Description: XVI, 420 p.ISBN: 978-1-4614-5128-0.Subject - Topical Name: 4914Online Resources:Click here to access onlineItem type | Current library | Collection | Call number | Copy number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|---|---|
E-Books | Biblioteca NOVA FCT Online | Não Ficção | QA613.SPR FCT 81369 (Browse shelf(Opens below)) | 1 | Available |
Browsing Biblioteca NOVA FCT shelves, Shelving location: Online, Collection: Não Ficção Close shelf browser (Hides shelf browser)
QA613.SPR FCT Topology of infinite-dimensional manifolds | QA613.SPR FCT 81047 The heat Kernel Lefschetz fixed point formula for the spin-c Dirac operator | QA613.SPR FCT 81214 An introduction to manifolds | QA613.SPR FCT 81369 Distance geometry, theory, methods, and applications | QA613.SPR FCT 81884 Contact and symplectic topology | QA613.SPR FCT 82364 Differential operators on manifolds | QA613.SPR FCT 82851 Smooth manifolds |
Colocação: Online
Distance Geometry: Theory, Methods, and Applications is the first collection of research surveys dedicated to distance geometry and its applications. The first part of the book discusses theoretical aspects of the Distance Geometry Problem (DGP), where the relation between DGP and other related subjects are also presented. Covered topics include distance matrix theory, Euclidean distance matrix completion, multispherical structure of distance matrices, geometric algebra, algebraic distance geometry theory, visualization of K-dimensional structures in the plane, graph rigidity, and theory of discretizable DGP. The second part of this volume presents mathematical and computational properties of methods developed to the problems discussed in the first portion, including continuous methods (based on Gaussian and hyperbolic smoothing, difference of convex functions, semidefinite programming, branch-and-bound), discrete methods (based on branch-and-prune, geometric build-up, graph rigidity), and also heuristics methods (based on simulated annealing, genetic algorithms, tabu search, variable neighborhood search). Applications comprise the third part of the book, which is mainly devoted to the application of DGP to NMR structure calculation. This is an important and strongly multidisciplinary application in biology and biomedicine.
There are no comments on this title.