2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/30540The 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, 2000Computational Engineering, Finance, and ScienceDiscrete MathematicsData Structures and AlgorithmsF.2.2; G.2.3; J.3text