The Enhanced Double Digest Problem for DNA Physical Mapping

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
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

Keywords

Computational Engineering, Finance, and Science, Discrete Mathematics, Data Structures and Algorithms, F.2.2; G.2.3; J.3

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/30540

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0102010
 http://arxiv.org/abs/cs/0102010

Collections

arXiv