scientific article; zbMATH DE number 2188749

zbMath1066.51500MaRDI QIDQ5461825

Gordon M. Crippen, Timothy F. Havel

Publication date: 27 July 2005

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

General theory of distance geometry (51K05) Molecular physics (81V55) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Research exposition (monographs, survey articles) pertaining to geometry (51-02)

Related Items

Classifying the globally rigid edge‐transitive graphs and distance‐regular graphs in the plane, A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems, Computing Circuit Polynomials in the Algebraic Rigidity Matroid, A systematic framework for solving geometric constraints analytically, On rigidity and realizability of weighted graphs, Decomposition plans for geometric constraint systems. I: Performance measures for CAD, Two theorems on Euclidean distance matrices and Gale transform, Positive semidefinite relaxations for distance geometry problems., A unified interpretation of stress in molecular systems, Detecting All Dependences in Systems of Geometric Constraints Using the Witness Method, Preface, The unassigned distance geometry problem, Geometric algebra to model uncertainties in the discretizable molecular distance geometry problem, Solving molecular distance geometry problems by global optimization algorithms, Reconfiguring closed polygonal chains in Euclidean \(d\)-space, Problems of distance geometry and convex properties of quadratic maps, Connections between the real positive semidefinite and distance matrix completion problems, An improved hybrid global optimization method for protein tertiary structure prediction, Characterizing graphs with convex and connected Cayley configuration spaces, Metric graphs elastically embeddable in the plane, The cone of distance matrices, An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data, Estimating polypeptide \(\alpha\)-carbon distances from multiple sequence alignments, Linear finite element superconvergence on simplicial meshes, Circum-Euclidean distance matrices and faces, Cuts, matrix completions and graph rigidity, Computational experience with an algorithm for tetrangle inequality bound smoothing, Regular spatial hexagons, On the reconstruction of three-dimensional protein structures from contact maps, Robust procedures for converting among Lindblad, Kraus and matrix representations of quantum dynamical semigroups, Sensor network localization with imprecise distances, A constrained interval approach to the generalized distance geometry problem, Sensor network localization, Euclidean distance matrix completions, and graph realization, Straightening Euclidean invariants, Mechanical theorem proving in projective geometry, The discretizable distance geometry problem, Constructing uniquely realizable graphs, Recent advances on the interval distance geometry problem, Clifford algebra and the discretizable molecular distance geometry problem, Hyperspherical embedding of graphs and networks in communicability spaces, Hyperbolic smoothing and penalty techniques applied to molecular structure determination, Descriptive matrix factorization for sustainability. Adopting the principle of opposites, Rejoinder on: ``Distance geometry and data science, Solving the multiple instance problem with axis-parallel rectangles., Solving a generalized distance geometry problem for protein structure determination, On the uniqueness of Euclidean distance matrix completions., The configuration space of a model for ringed hydrocarbon molecules, Solving Partial Differential Equations on Manifolds From Incomplete Interpoint Distance, Least-squares approximations in geometric buildup for solving distance geometry problems, A NOTE ON COMPUTING THE INTERSECTION OF SPHERES IN, On the Exact Solution of the Distance Geometry with Interval Distances in Dimension 1, Distance geometry algorithms in molecular modelling of polymer and composite systems., Geometric buildup algorithms for sensor network localization, On convex relaxations of quadrilinear terms, On the number of realizations of certain Henneberg graphs arising in protein conformation, Minimal NMR distance information for rigidity of protein graphs, Oriented conformal geometric algebra and the molecular distance geometry problem, Discretization orders and efficient computation of Cartesian coordinates for distance geometry, Some examples of the use of distances as coordinates for euclidean geometry, The embedding problem for predistance matrices, Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures, Compensated convexity and its applications, Discretization orders for protein side chains, Graph rigidity via Euclidean distance matrices, Rigid versus unique determination of protein structures with geometric buildup, An alternative approach to distance geometry using \(L^\infty\) distances, Discretization vertex orders in distance geometry, Assigned and unassigned distance geometry: applications to biological molecules and nanostructures, On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data, On the dual rigidity matrix, On the optimality of finding DMDGP symmetries, Preface: Special issue dedicated to distance geometry, Formation control using range-only measurements, The discretizable molecular distance geometry problem, Tolerances in geometric constraint problems, Semidefinite programming for discrete optimization and matrix completion problems, On the computation of protein backbones by using artificial backbones of hydrogens, Noisy Euclidean distance matrix completion with a single missing node, On the nonnegative rank of Euclidean distance matrices, On the nullspace, the rangespace and the characteristic polynomial of Euclidean distance matrices, On the uniqueness of Euclidean distance matrix completions: the case of points in general position, Connected rigidity matroids and unique realizations of graphs, Interrogating witnesses for geometric constraint solving, Polyspherical coordinate systems on orbit spaces with applications to biomolecular shape, Geometric algebra to describe the exact discretizable molecular distance geometry problem for an arbitrary dimension, On bar frameworks, stress matrices and semidefinite programming, Geometric modeling applications in rational drug design: a survey, Euclidean Distance Matrices and Applications, A new algorithm for the \(^K\)DMDGP subclass of distance geometry problems with exact distances, A remark on global positioning from local distances, Unnamed Item, Trajectory analysis via a geometric feature space approach, A Euclidean distance matrix model for protein molecular conformation, DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology, Double variable neighbourhood search with smoothing for the molecular distance geometry problem, On the polynomiality of finding \(^K\text{DMDGP}\) re-orders, Using a CAS/DGS to analyze computationally the configuration of planar bar linkage mechanisms based on partial Latin squares, A genetic algorithm for circulant Euclidean distance matrices, Selected Open Problems in Discrete Geometry and Optimization, A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation, How to describe or design a polyhedron, ON THE RANK FUNCTION OF THE 3-DIMENSIONAL RIGIDITY MATROID, SOLVING SPATIAL CONSTRAINTS WITH GLOBAL DISTANCE COORDINATE SYSTEM, NON-CARTESIAN MODELLING FOR ANALYSIS OF THE CONSISTENCY OF A GEOMETRIC SPECIFICATION FOR CONCEPTUAL DESIGN, Searching for spreads and packings, Constrained Best Euclidean Distance Embedding on a Sphere: A Matrix Optimization Approach, A quantum approach to the discretizable molecular distance geometry problem, Local, Dimensional and Universal Rigidities: A Unified Gram Matrix Approach, Distance matrices and regular figures, Completion of Hankel partial contractions of extremal type, An optimization problem on subsets of the symmetric positive-semidefinite matrices