The minimum distance superset problem: formulations and algorithms
Sign Up to like & getrecommendations! Published in 2018 at "Journal of Global Optimization"
DOI: 10.1007/s10898-017-0579-9
Abstract: The partial digest problem consists in retrieving the positions of a set of points on the real line from their unlabeled pairwise distances. This problem is critical for DNA sequencing, as well as for phase… read more here.
Keywords: minimum distance; distance; superset problem; distance superset ... See more keywords