scientific article; zbMATH DE number 2209734
From MaRDI portal
Publication:5692717
zbMath1104.68803MaRDI QIDQ5692717
Warren D. Smith, Paul Lemke, Steven S. Skiena
Publication date: 28 September 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The restriction mapping problem revisited. ⋮ Shape classification based on interpoint distance distributions ⋮ Unassigned distance geometry and molecular conformation problems ⋮ The metric space of limit laws for $q$-hook formulas ⋮ Homometry and direct-sum decompositions of lattice-convex sets ⋮ Construction of component tapes for radial placement machines ⋮ The number of clone orderings ⋮ An identity theorem for the Fourier-Laplace transform of polytopes on nonzero complex multiples of rationally parameterizable hypersurfaces ⋮ The simplified partial digest problem: approximation and a graph-theoretic model ⋮ Distance distributions and inverse problems for metric measure spaces ⋮ A new dynamic programming algorithm for the simplified partial digest problem ⋮ On the reconstruction of planar lattice-convex sets from the covariogram ⋮ A fast algorithm for the partial digest problem ⋮ Encounter at far point ⋮ Lattices with few distances ⋮ Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures ⋮ The complexity of minimum difference cover ⋮ Assigned and unassigned distance geometry: applications to biological molecules and nanostructures ⋮ On homometric sets in graphs ⋮ Quantitative crystal structure descriptors from multiplicative congruential generators ⋮ The minimum distance superset problem: formulations and algorithms ⋮ On the approximability of the simplified partial digest problem ⋮ Randomized vs. deterministic distance query strategies for point location on the line ⋮ On the graph turnpike problem ⋮ Computational geometric aspects of rhythm, melody, and voice-leading ⋮ Generalized shapes and point sets correspondence and registration ⋮ A point set puzzle revisited ⋮ A SCALABLE PARALLEL ALGORITHM FOR TURNPIKE PROBLEM ⋮ On the complexity of constructing Golomb rulers ⋮ String Reconstruction from Substring Compositions ⋮ Some necessary clarifications about the chords' problem and the partial digest problem ⋮ The chords' problem ⋮ A partial digest approach to restriction site mapping ⋮ Partial digest is hard to solve for erroneous input data
