The Enhanced Double Digest Problem for DNA Physical Mapping

TL;DR

This paper introduces the enhanced double digest problem for DNA physical mapping, which remains NP-hard but can be solved efficiently in specific cases, improving understanding of DNA mapping challenges.

Contribution

It proposes a new variant of the double digest problem that is solvable in linear time under certain conditions, advancing computational methods in DNA mapping.

Findings

Enhanced problem formulation for DNA mapping

Linear-time solutions in specific cases

NP-hardness preserved in the new problem

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.