Reconstructing sets from interpoint distances (extended abstract)

Authors:
Steven S. Skiena;Warren D. Smith;Paul Lemke
Affiliations:
Department of Computer Science, State University of New York, Stony Brook, NY;AT&T Bell Laboratories, 600 Mountain Avenue, Murray Hill, NJ;Department of Mathematical Sciences, Rensselaer Polytechnic Institute, Troy NY
Venue:
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Year:
1990

Citing 1
Cited 17

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Deductive databases in action

PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Mapping the genome: some combinatorial problems arising in molecular biology

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Shape distributions

ACM Transactions on Graphics (TOG)
The chords' problem

Theoretical Computer Science
The restriction mapping problem revisited

Journal of Computer and System Sciences - Computational biology 2002
Some necessary clarifications about the chords' problem and the partial digest problem

Theoretical Computer Science
On the complexity of the DNA simplified partial digest problem

CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
Partial digest is hard to solve for erroneous input data

Theoretical Computer Science
Simplified Partial Digest Problem: Enumerative and Dynamic Programming Algorithms

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Embedding and similarity search for point sets under translation

Proceedings of the twenty-fourth annual symposium on Computational geometry
A point set puzzle revisited

European Journal of Combinatorics
On the approximability of the Simplified Partial Digest Problem

Discrete Applied Mathematics
Multiplex de novo sequencing of peptide antibiotics

RECOMB'11 Proceedings of the 15th Annual international conference on Research in computational molecular biology
3-D shape analysis of anatomical structures based on an interactive multiresolution approach

PCM'04 Proceedings of the 5th Pacific Rim conference on Advances in Multimedia Information Processing - Volume Part I
Reconstructing a simple polygon from its angles

SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
On the complexity of the DNA simplified partial digest problem

CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51
Genetic algorithm solution for partial digest problem

International Journal of Bioinformatics Research and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of determining which point sets in some given space realise a given distance multiset. Special cases include the “turnpike problem” where the points lie on a line, and the “beltway problem” where the points lie on a loop. Of interest is the algorithmic problem of determining such point sets for a given collection of distances and the combinatorial problem of finding bounds on the maximum number of different solutions. These problems find applications in many fields, including genetics and crystallography.In this paper, we give improved combinatorial bounds for the turnpike and baltway problems in both one and higher dimensions. We present a practical algorithm which, on n points drawn at random from a real interval, finds all solutions in &Ogr; (n2logn) time with probability 1. We also prove that some variants of the problem are NP-complete.