Positional Sequencing by
Hybridization
In this problem each k-mer has at most t possible positions where
it can appear in the final sequence. The main results are
a polynomial algorithm for t=2 and a hardness result for t=3.
Joint also with Amir Ben Dor