The Enhanced Double Digest Problem for DNA Physical Mapping |
| |
| Authors: | Ming-Yang Kao Jared Samet Wing-Kin Sung |
| |
| Affiliation: | (1) Department of Computer Science, Yale University, New Haven, CT 06520, USA;(2) Yale College, New Haven, CT 06520, USA |
| |
| 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 |
| 本文献已被 SpringerLink 等数据库收录！ |
