The Enhanced Double Digest Problem for DNA Physical Mapping
Computational Engineering, Finance, and Science
2007-05-23 v1 Discrete Mathematics
Data Structures and Algorithms
Abstract
The double digest problem is a common NP-hard approach to constructing physical maps of DNA sequences. This paper presents a new approach called the enhanced double digest problem. Although this new problem is also NP-hard, it can be solved in linear time in certain theoretically interesting cases.
Cite
@article{arxiv.cs/0102010,
title = {The Enhanced Double Digest Problem for DNA Physical Mapping},
author = {Ming-Yang Kao and Jared Samet and Wing-Kin Sung},
journal= {arXiv preprint arXiv:cs/0102010},
year = {2007}
}
Comments
A preliminary version appeared in M. Halldorsson, editor, Lecture Notes in Computer Science 1851: Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, pages 383--392. Springer-Verlag, New York, NY, 2000