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.
Research supported in part by NSF Grant 9531028.
This work is developed at Yale University.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
W. M. Fitch, T. F. Smith, and W. W. Ralph. Mapping the order of DNA restriction fragments. Gene, 22:19–29, 1983.
M. Garey and D. Johnson. Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman, San Francisco, 1979.
L. Goldstein and M. S. Waterman. Mapping DNA by stochastic relaxation. Advances in Applied Mathematics, 8:194–207, 1987.
Richard M. Karp. Mapping the genome: Some combinatorial problems arising in molecular biology. In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, pages 278–285, San Diego, California, 16–18 May 1993.
D. Nathans and H. O. Smith. Restriction endonuleases in the analysis and restructuring of DNA molecules. Annual Review of Biochemistry, 44:273–293, 1975.
P. A. Pevzner. DNA physical mapping, flows in networks and minimum cycles mean in graphs. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 8:99–112, 1992.
P. A. Pevzner. DNA physical mapping and alternating Eulerian cycles in colored graphs. Algorithmica, 13:77–105, 1995.
W. Schmitt and M. S. Waterman. Multiple solutions of DNA restriction mapping problems. Advances in Applied Mathematics, 12:412–427, 1991.
M. Stefik. Inferring DNA structure from segmentation data. Artificial Intelligence, 11:85–114, 1978.
M. S. Waterman and J. R. Griggs. Interval graphs and maps of DNA. Bulletin of Mathematical Biology, 48:189–195, 1986.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kao, MY., Samet, J., Sung, WK. (2000). The Enhanced Double Digest Problem for DNA Physical Mapping. In: Algorithm Theory - SWAT 2000. SWAT 2000. Lecture Notes in Computer Science, vol 1851. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44985-X_33
Download citation
DOI: https://doi.org/10.1007/3-540-44985-X_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67690-4
Online ISBN: 978-3-540-44985-0
eBook Packages: Springer Book Archive