The Enhanced Double Digest Problem for DNA Physical Mapping

Ming-Yang Kao (), Jared Samet () and Wing-Kin Sung ()
Additional contact information
Ming-Yang Kao: Yale University
Jared Samet: Yale College
Wing-Kin Sung: Yale University

Journal of Combinatorial Optimization, 2003, vol. 7, issue 1, No 4, 69-78

Abstract: 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.

Keywords: DNA physical mapping; fast algorithms; graph-theoretic techniques; NP-hardness (search for similar items in EconPapers)
Date: 2003
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1023/A:1021946523069 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:7:y:2003:i:1:d:10.1023_a:1021946523069

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1023/A:1021946523069

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().