DMCA
The greedy path-merging algorithm for sequence assembly (2001)
| Venue: | Proc. RECOMB 2001 |
| Citations: | 9 - 3 self |
BibTeX
@INPROCEEDINGS{Huson01thegreedy,
author = {Daniel H. Huson and Knut Reinert and Eugene W. Myers},
title = {The greedy path-merging algorithm for sequence assembly},
booktitle = {Proc. RECOMB 2001},
year = {2001},
pages = {157--163},
publisher = {Press}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Two different approaches to determining the human genome are currently being pursued: one is the “clone-by-clone ” approach, employed by the publicly-funded Human Genome Project, and the other is the “whole genome shotgun ” approach, favored by researchers at Celera Genomics. An interim strategy employed at Celera, called compartmentalized assembly, makes use of preliminary data produced by both approaches. This paper introduces the Bactig Ordering Problem, which is a key problem that arises in this context, and presents an efficient heuristic called the greedy path-merging algorithm that performs well on real data. 1
