Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
SpringerLink
Log in

The Enhanced Double Digest Problem for DNA Physical Mapping

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

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.

    Google Scholar 

  • M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman: New York, NY, 1979.

    Google Scholar 

  • L. Goldstein and M.S. Waterman, “Mapping DNA by stochastic relaxation,” Advances in Applied Mathematics, vol. 8, pp. 194-207, 1987.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • P.A. Pevzner, “DNA physical mapping and alternating Eulerian cycles in colored graphs,” Algorithmica, vol. 13, no. 1/2, pp. 77-105, 1995.

    Google Scholar 

  • W. Schmitt and M.S. Waterman, “Multiple solutions of DNA restriction mapping problems,” Advances in Applied Mathematics, vol. 12, pp. 412-427, 1991.

    Google Scholar 

  • M. Stefik, “Inferring DNA structure from segmentation data,” Artificial Intelligence, vol. 11, pp. 85-114, 1978.

    Google Scholar 

  • 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Yale University, New Haven, CT, 06520, USA

    Ming-Yang Kao & Wing-Kin Sung

  2. Yale College, New Haven, CT, 06520, USA

    Jared Samet

Authors
  1. Ming-Yang Kao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jared Samet
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wing-Kin Sung
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1021946523069

Search

Navigation