BFAST: An Alignment Tool for Large Scale Genome Resequencing

被引:343
作者
Homer, Nils
Merriman, Barry
Nelson, Stanley F.
机构
[1] Department of Computer Science, University of California Los Angeles, Los Angeles, CA
[2] Department of Human Genetics, David Geffen School of Medicine, University of California Los Angeles, Los Angeles, CA
来源
PLOS ONE | 2009年 / 4卷 / 11期
关键词
HOMOLOGY SEARCH; DNA; GENERATION; SEEDS; BLAST;
D O I
10.1371/journal.pone.0007767
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Background: The new generation of massively parallel DNA sequencers, combined with the challenge of whole human genome resequencing, result in the need for rapid and accurate alignment of billions of short DNA sequence reads to a large reference genome. Speed is obviously of great importance, but equally important is maintaining alignment accuracy of short reads, in the 25-100 base range, in the presence of errors and true biological variation. Methodology: We introduce a new algorithm specifically optimized for this task, as well as a freely available implementation, BFAST, which can align data produced by any of current sequencing platforms, allows for user-customizable levels of speed and accuracy, supports paired end data, and provides for efficient parallel and multi-threaded computation on a computer cluster. The new method is based on creating flexible, efficient whole genome indexes to rapidly map reads to candidate alignment locations, with arbitrary multiple independent indexes allowed to achieve robustness against read errors and sequence variants. The final local alignment uses a Smith-Waterman method, with gaps to support the detection of small indels. Conclusions: We compare BFAST to a selection of large-scale alignment tools - BLAT, MAQ, SHRiMP, and SOAP - in terms of both speed and accuracy, using simulated and real-world datasets. We show BFAST can achieve substantially greater sensitivity of alignment in the context of errors and true variants, especially insertions and deletions, and minimize false mappings, while maintaining adequate speed compared to other current methods. We show BFAST can align the amount of data needed to fully resequence a human genome, one billion reads, with high sensitivity and accuracy, on a modest computer cluster in less than 24 hours. BFAST is available at http://bfast.sourceforge.net.
引用
收藏
页码:A95 / A106
页数:12
相关论文
共 22 条
  • [1] Gapped BLAST and PSI-BLAST: a new generation of protein database search programs
    Altschul, SF
    Madden, TL
    Schaffer, AA
    Zhang, JH
    Zhang, Z
    Miller, W
    Lipman, DJ
    [J]. NUCLEIC ACIDS RESEARCH, 1997, 25 (17) : 3389 - 3402
  • [2] Whole-genome re-sequencing
    Bentley, David R.
    [J]. CURRENT OPINION IN GENETICS & DEVELOPMENT, 2006, 16 (06) : 545 - 552
  • [3] Cox A.J., 2007, ELAND EFFICIENT LOCA
  • [4] The new paradigm of flow cell sequencing
    Holt, Robert A.
    Jones, Steven J. M.
    [J]. GENOME RESEARCH, 2008, 18 (06) : 839 - 846
  • [5] Local alignment of two-base encoded DNA sequence
    Homer, Nils
    Merriman, Barry
    Nelson, Stanley F.
    [J]. BMC BIOINFORMATICS, 2009, 10
  • [6] DNA sequencing: bench to bedside and beyond
    Hutchison, Clyde A., III
    [J]. NUCLEIC ACIDS RESEARCH, 2007, 35 (18) : 6227 - 6237
  • [7] Multiple spaced seeds for homology search
    Ilie, Lucian
    Ilie, Silvana
    [J]. BIOINFORMATICS, 2007, 23 (22) : 2969 - 2977
  • [8] Kent WJ, 2002, GENOME RES, V12, P656, DOI [10.1101/gr.229202. Article published online before March 2002, 10.1101/gr.229202]
  • [9] Ultrafast and memory-efficient alignment of short DNA sequences to the human genome
    Langmead, Ben
    Trapnell, Cole
    Pop, Mihai
    Salzberg, Steven L.
    [J]. GENOME BIOLOGY, 2009, 10 (03):
  • [10] Mapping short DNA sequencing reads and calling variants using mapping quality scores
    Li, Heng
    Ruan, Jue
    Durbin, Richard
    [J]. GENOME RESEARCH, 2008, 18 (11) : 1851 - 1858