A Geometric Build-Up Algorithm for Solving the Molecular Distance Geometry Problem with Sparse Distance Data
Authors:
- 1 July 2003
- journal article
- Published by Springer Nature in Journal of Global Optimization
- Vol. 26 (3) , 321-333
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distancesJournal of Global Optimization, 2002
- The Protein Data BankNucleic Acids Research, 2000
- Distance Geometry Optimization for Protein StructuresJournal of Global Optimization, 1999
- Global Continuation for Distance Geometry ProblemsSIAM Journal on Optimization, 1997
- (varepsilon)-optimal solutions to distance geometry problems via global continuation1995
- RASMOL: biomolecular graphics for allTrends in Biochemical Sciences, 1995
- Molecular conformations from distance matricesJournal of Computational Chemistry, 1993
- Subunit‐selective mutagenesis indicates minimal polymerase activity in heterodimer‐associated p51 HIV‐1 reverse transcriptase.The EMBO Journal, 1991