An Eulerian path approach to DNA fragment assembly
- PMID: 11504945
- PMCID: PMC55524
- DOI: 10.1073/pnas.171285098
An Eulerian path approach to DNA fragment assembly
Abstract
For the last 20 years, fragment assembly in DNA sequencing followed the "overlap-layout-consensus" paradigm that is used in all currently available assembly tools. Although this approach proved useful in assembling clones, it faces difficulties in genomic shotgun assembly. We abandon the classical "overlap-layout-consensus" approach in favor of a new euler algorithm that, for the first time, resolves the 20-year-old "repeat problem" in fragment assembly. Our main result is the reduction of the fragment assembly to a variation of the classical Eulerian path problem that allows one to generate accurate solutions of large-scale sequencing problems. euler, in contrast to the celera assembler, does not mask such repeats but uses them instead as a powerful fragment assembly tool.
Figures
References
-
- Green P. Documentation for phrap. 1994. (http://www.genome.washington.edu/UWGC/analysis-tools/phrap.htm).
-
- Sutton G, White O, Adams M, Kerlavage A. Genome Sci Technol. 1995;1:9–19.
-
- Kececioglu J, Myers E. Algorithmica. 1995;13:7–51.
-
- Myers E M. J Comput Biol. 1995;2:275–290. - PubMed
Publication types
MeSH terms
Substances
LinkOut - more resources
Full Text Sources
Other Literature Sources
