The Enhanced Double Digest Problem for DNA Physical Mapping

Authors:
Ming-Yang Kao;Jared Samet;Wing-Kin Sung
Affiliations:
-;-;-
Venue:
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Year:
2000

Citing 4
Cited 1

Mapping DNA by stochastic relaxation

Advances in Applied Mathematics
Multiple solutions of DNA restriction mapping problems

Advances in Applied Mathematics
Mapping the genome: some combinatorial problems arising in molecular biology

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Genetic algorithm for double digest problem

PReMI'05 Proceedings of the First international conference on Pattern Recognition and Machine Intelligence

Quantified Score

Hi-index	0.00

Visualization

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 under a certain restriction, which is satisfied reasonably frequently.