The Turnpike problem aims to reconstruct a set of one-dimensional points from their
unordered pairwise distances. Turnpike arises in biological applications such as molecular …

Background Restriction site analysis involves determining the locations of restriction sites
after the process of digestion by reconstructing their positions based on the lengths of the cut …

A new uniform algorithm based on sequential removal of redundancy from inputs is
proposed to solve the turnpike and beltway problems. For error-free inputs that simulate …

Abstract The Beltway and Turnpike problems entail the reconstruction of circular and linear
one-dimensional point sets from unordered pairwise distances. These problems arise in …

The simplified partial digest problem (SPDP) models an effective and robust method for
building physical maps using restriction site analysis. Blazewicz and Kasprzak proved that …

One of the fundamental problems in computational biology is the construction of physical
maps of chromosomes from the hybridisation experiments between unique probes and …

The partial digest problem, PDP, is one of the methods used in restriction map** to
characterize a fragment of DNA. The main challenge of PDP is the exponential time for the …

We consider the partial digest problem, which aims to find the set X={x< sub> 0, x< sub> 1,...,
x< sub> n} such that ΔX={| x< sub> jx< sub> i|, 0≤ i≤ n} is equal to the input of the problem …