next up previous
Next: Cloning Up: Biotechnological Methods Previous: Sequencing

The Sequence Assembly problem


\begin{problem}Given a set of sub-strings, find the minimal string containing all of the members
of the set.
\end{problem}
Although this problem may seem simple, it is known to be NP-Complete. However, there are greedy algorithms which perform fairly well in practice. This problem is actually more complicated due to the existence of repetitive sequences in the genome.



Peer Itsik
2000-11-13