Distance Geometry
Theory, Methods, and Applications
Our rough guess is there are 105,000 words in this book.
At a pace averaging 250 words per minute, this book will take 7 hours and 0 minutes to read. With a half hour per day, this will take 14 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
We earn a commission on purchases
Author
Contributions
- Lavor, Carlile - Contributor
- Liberti, Leo - Contributor
- Maculan, Nelson - Contributor
- SpringerLink (Online service) - Contributor
Publication
2013 - Springer New York, New York, NY, United States
Language
English
Word Count
105,000 words, Guess
Page Count
420 pages
Physical Format
[electronic resource] :
Identifiers
- Open LibraryOL27032824M
- ISBN-139781461451280
- OCLC Control Number830460368
- Library of Congress Control Number2012952099
Classifications
- DDC516
- LCCQA440-699
Description
<p><i>Distance Geometry: Theory, Methods, and Applications</i> 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.<br><br>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).<br><br>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.</p>
Subjects
Other Editions
- Distance Geometry: Theory, Methods, and Applications
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!