Electronic Resource
Springer
Journal of global optimization
15 (1999), S. 219-234
ISSN:
1573-2916
Keywords:
Distance geometry
;
Distance constraints
;
Protein structures
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract We study the performance of the dgsol code for the solution of distance geometry problems with lower and upper bounds on distance constraints. The dgsol code uses only a sparse set of distance constraints, while other algorithms tend to work with a dense set of constraints either by imposing additional bounds or by deducing bounds from the given bounds. Our computational results show that protein structures can be determined by solving a distance geometry problem with dgsol and that the approach based on dgsol is significantly more reliable and efficient than multi-starts with an optimization code.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1008380219900
Permalink
|
Location |
Call Number |
Expected |
Availability |
