The Enhanced Double Digest Problem for DNA Physical Mapping

Simple item page
dc.creatorKao, Ming-Yang
dc.creatorSamet, Jared
dc.creatorSung, Wing-Kin
dc.date2001-02-10
dc.date.accessioned2026-07-07T03:16:56Z
dc.date.available2026-07-07T03:16:56Z
dc.descriptionThe 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.
dc.descriptionA 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
dc.identifierhttps://arxiv.org/abs/cs/0102010
dc.identifierhttp://arxiv.org/abs/cs/0102010
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30540
dc.subjectComputational Engineering, Finance, and Science
dc.subjectDiscrete Mathematics
dc.subjectData Structures and Algorithms
dc.subjectF.2.2; G.2.3; J.3
dc.titleThe Enhanced Double Digest Problem for DNA Physical Mapping
dc.typetext

Files

Collections

arXiv