next up previous
Next: Sequencing Up: Biotechnological Methods Previous: The Partial Digest Problem

The Double Digest Problem


\begin{problem}Given three sets of distances $\{\vert A_{i}-A_{i-1}\vert\}_{2\le... ...ots \) , \( A_{n} \) , \( B_{1} \) , \( \ldots \) , \( B_{m} \) . \end{problem}
This is an NP-hard problem, but there are some heuristics to solve it.


Peer Itsik
2000-11-13