Reconstructing a three-dimensional model with arbitrary errors

DOI10.1145/301970.301972zbMath1065.68574OpenAlexW2070646792MaRDI QIDQ3158536

Leighton, Tom, Bonnie Berger, Jon M. Kleinberg

Publication date: 25 January 2005

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/301970.301972

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Protein sequences, DNA sequences (92D20) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (13)

Geometric algebra to model uncertainties in the discretizable molecular distance geometry problem ⋮ Maximum feasible subsystems of distance geometry constraints ⋮ Unique low rank completability of partially filled matrices ⋮ Planar straight-line realizations of 2-trees with prescribed edge lengths ⋮ Clifford algebra and the discretizable molecular distance geometry problem ⋮ LRA: local rigid averaging of stretchable non-rigid shapes ⋮ Solving Partial Differential Equations on Manifolds From Incomplete Interpoint Distance ⋮ On the number of realizations of certain Henneberg graphs arising in protein conformation ⋮ Assigned and unassigned distance geometry: applications to biological molecules and nanostructures ⋮ Preface: Special issue dedicated to distance geometry ⋮ The discretizable molecular distance geometry problem ⋮ Preface ⋮ Barvinok's naive algorithm in distance geometry

This page was built for publication: Reconstructing a three-dimensional model with arbitrary errors