Ultrafast and memory-efficient alignment of short DNA sequences to the human genome

Ben Langmead, Cole Trapnell, Mihai Pop, Steven L Salzberg

Research output: Contribution to journalArticle

Abstract

Bowtie is an ultrafast, memory-efficient alignment program for aligning short DNA sequence reads to large genomes. For the human genome, Burrows-Wheeler indexing allows Bowtie to align more than 25 million reads per CPU hour with a memory footprint of approximately 1.3 gigabytes. Bowtie extends previous Burrows-Wheeler techniques with a novel quality-aware backtracking algorithm that permits mismatches. Multiple processor cores can be used simultaneously to achieve even greater alignment speeds. Bowtie is open source http://bowtie.cbcb.umd.edu.

Original languageEnglish (US)
Article numberR25
JournalGenome Biology
Volume10
Issue number3
DOIs
StatePublished - Mar 4 2009
Externally publishedYes

Fingerprint

Human Genome
burrow
burrows
genome
nucleotide sequences
DNA
footprint
Genome
alignment
methodology
speed
programme

ASJC Scopus subject areas

  • Genetics
  • Cell Biology
  • Ecology, Evolution, Behavior and Systematics

Cite this

Ultrafast and memory-efficient alignment of short DNA sequences to the human genome. / Langmead, Ben; Trapnell, Cole; Pop, Mihai; Salzberg, Steven L.

In: Genome Biology, Vol. 10, No. 3, R25, 04.03.2009.

Research output: Contribution to journalArticle

@article{b9329000dc2b4494b646b92e15f7440b,
title = "Ultrafast and memory-efficient alignment of short DNA sequences to the human genome",
abstract = "Bowtie is an ultrafast, memory-efficient alignment program for aligning short DNA sequence reads to large genomes. For the human genome, Burrows-Wheeler indexing allows Bowtie to align more than 25 million reads per CPU hour with a memory footprint of approximately 1.3 gigabytes. Bowtie extends previous Burrows-Wheeler techniques with a novel quality-aware backtracking algorithm that permits mismatches. Multiple processor cores can be used simultaneously to achieve even greater alignment speeds. Bowtie is open source http://bowtie.cbcb.umd.edu.",
author = "Ben Langmead and Cole Trapnell and Mihai Pop and Salzberg, {Steven L}",
year = "2009",
month = "3",
day = "4",
doi = "10.1186/gb-2009-10-3-r25",
language = "English (US)",
volume = "10",
journal = "Genome Biology",
issn = "1474-7596",
publisher = "BioMed Central",
number = "3",

}

TY - JOUR

T1 - Ultrafast and memory-efficient alignment of short DNA sequences to the human genome

AU - Langmead, Ben

AU - Trapnell, Cole

AU - Pop, Mihai

AU - Salzberg, Steven L

PY - 2009/3/4

Y1 - 2009/3/4

N2 - Bowtie is an ultrafast, memory-efficient alignment program for aligning short DNA sequence reads to large genomes. For the human genome, Burrows-Wheeler indexing allows Bowtie to align more than 25 million reads per CPU hour with a memory footprint of approximately 1.3 gigabytes. Bowtie extends previous Burrows-Wheeler techniques with a novel quality-aware backtracking algorithm that permits mismatches. Multiple processor cores can be used simultaneously to achieve even greater alignment speeds. Bowtie is open source http://bowtie.cbcb.umd.edu.

AB - Bowtie is an ultrafast, memory-efficient alignment program for aligning short DNA sequence reads to large genomes. For the human genome, Burrows-Wheeler indexing allows Bowtie to align more than 25 million reads per CPU hour with a memory footprint of approximately 1.3 gigabytes. Bowtie extends previous Burrows-Wheeler techniques with a novel quality-aware backtracking algorithm that permits mismatches. Multiple processor cores can be used simultaneously to achieve even greater alignment speeds. Bowtie is open source http://bowtie.cbcb.umd.edu.

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

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

U2 - 10.1186/gb-2009-10-3-r25

DO - 10.1186/gb-2009-10-3-r25

M3 - Article

C2 - 19261174

AN - SCOPUS:62349130698

VL - 10

JO - Genome Biology

JF - Genome Biology

SN - 1474-7596

IS - 3

M1 - R25

ER -