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.
Similar content being viewed by others
References
W.M. Fitch, T.F. Smith, and W.W. Ralph, “Mapping the order of DNA restriction fragments,” Gene, vol. 22, pp.19-29, 1983.
M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman: New York, NY, 1979.
L. Goldstein and M.S. Waterman, “Mapping DNA by stochastic relaxation,” Advances in Applied Mathematics, vol. 8, pp. 194-207, 1987.
R. Karp, “Mapping of the genome: Some combinatorial problems arising in molecular biology,” in Proceedings of the 25th Annual ACM Symposium on Theory of Computing, 1993, pp. 278-285.
D. Nathans and H.O. Smith, “Restriction endonuleases in the analysis and restructuring of DNA molecules,” Annual Review of Biochemistry, vol. 44, pp. 273-293, 1975.
P.A. Pevzner, “DNA physical mapping, flows in networks and minimum cycles mean in graphs,” in S.G. Gindikin (Ed.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science 8: Mathematical Methods of Analysis of Biopolymer Sequences, American Mathematical Society: Providence, RI, 1992, pp. 99-112.
P.A. Pevzner, “DNA physical mapping and alternating Eulerian cycles in colored graphs,” Algorithmica, vol. 13, no. 1/2, pp. 77-105, 1995.
W. Schmitt and M.S. Waterman, “Multiple solutions of DNA restriction mapping problems,” Advances in Applied Mathematics, vol. 12, pp. 412-427, 1991.
M. Stefik, “Inferring DNA structure from segmentation data,” Artificial Intelligence, vol. 11, pp. 85-114, 1978.
M.S. Waterman and J.R. Griggs, “Interval graphs and maps of DNA,” Bulletin of Mathematical Biology, vol. 48, no. 2, pp. 189-195, 1986.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kao, MY., Samet, J. & Sung, WK. The Enhanced Double Digest Problem for DNA Physical Mapping. Journal of Combinatorial Optimization 7, 69–78 (2003). https://doi.org/10.1023/A:1021946523069
Issue Date:
DOI: https://doi.org/10.1023/A:1021946523069