Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data

@inproceedings{Cieliebak2003DoubleDR,
  title={Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data},
  author={Mark Cieliebak and Stephan Eidenbenz and Gerhard J. Woeginger},
  booktitle={COCOON},
  year={2003}
}
We revisit the double digest problem, which occurs in sequencing of large DNA strings and consists of reconstructing the relative positions of cut sites from two different enzymes: we rst show that double digest is strongly NP-complete, improving previous results that only showed weak NP-completeness. Even the (experimentally more meaningful) variation in which we disallow coincident cut sites turns out to be strongly NP-complete. In a second part, we model errors in data as they occur in real… CONTINUE READING

Similar Papers

Loading similar papers…