@inproceedings{51f4a124f8494584b6f3d5e240d0c6d7,

title = "The enhanced double digest problem for dna physical mapping",

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.",

keywords = "DNA physical mapping, Fast algorithms, Graph-theoretic techniques, NP-hardness",

author = "Kao, {Ming Yang} and Jared Samet and Sung, {Wing Kin}",

year = "2000",

month = jan,

day = "1",

doi = "10.1007/3-540-44985-X",

language = "English (US)",

isbn = "3540676902",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "383--392",

editor = "Halld{\'o}rsson, {Magn{\'u}s M.}",

booktitle = "Algorithm Theory - SWAT 2000 - 7th Scandinavian Workshop on Algorithm Theory, 2000, Proceedings",

address = "Germany",

note = "7th Scandinavian Workshop on Algorithm Theory, SWAT 2000 ; Conference date: 05-07-2000 Through 07-07-2000",

}