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

Original language | English (US) |
---|---|

Title of host publication | Algorithm Theory - SWAT 2000 - 7th Scandinavian Workshop on Algorithm Theory, 2000, Proceedings |

Publisher | Springer Verlag |

Pages | 383-392 |

Number of pages | 10 |

ISBN (Print) | 3540676902, 9783540676904 |

DOIs | |

State | Published - Jan 1 2000 |

Event | 7th Scandinavian Workshop on Algorithm Theory, SWAT 2000 - Bergen, Norway Duration: Jul 5 2000 → Jul 7 2000 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 1851 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 7th Scandinavian Workshop on Algorithm Theory, SWAT 2000 |
---|---|

Country | Norway |

City | Bergen |

Period | 7/5/00 → 7/7/00 |

### Fingerprint

### Keywords

- DNA physical mapping
- Fast algorithms
- Graph-theoretic techniques
- NP-hardness

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Algorithm Theory - SWAT 2000 - 7th Scandinavian Workshop on Algorithm Theory, 2000, Proceedings*(pp. 383-392). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1851). Springer Verlag. https://doi.org/10.1007/3-540-44985-X

}

*Algorithm Theory - SWAT 2000 - 7th Scandinavian Workshop on Algorithm Theory, 2000, Proceedings.*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1851, Springer Verlag, pp. 383-392, 7th Scandinavian Workshop on Algorithm Theory, SWAT 2000, Bergen, Norway, 7/5/00. https://doi.org/10.1007/3-540-44985-X

**The enhanced double digest problem for dna physical mapping.** / Kao, Ming Yang; Samet, Jared; Sung, Wing Kin.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - The enhanced double digest problem for dna physical mapping

AU - Kao, Ming Yang

AU - Samet, Jared

AU - Sung, Wing Kin

PY - 2000/1/1

Y1 - 2000/1/1

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

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

KW - DNA physical mapping

KW - Fast algorithms

KW - Graph-theoretic techniques

KW - NP-hardness

UR - http://www.scopus.com/inward/record.url?scp=84956864939&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84956864939&partnerID=8YFLogxK

U2 - 10.1007/3-540-44985-X

DO - 10.1007/3-540-44985-X

M3 - Conference contribution

AN - SCOPUS:84956864939

SN - 3540676902

SN - 9783540676904

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 383

EP - 392

BT - Algorithm Theory - SWAT 2000 - 7th Scandinavian Workshop on Algorithm Theory, 2000, Proceedings

PB - Springer Verlag

ER -