Darby, C.A., Gaddipati, R., Schatz, M.C., Langmead, B. (April 2020) Vargas: Heuristic-Free Alignment for Assessing Linear and Graph Read Aligners. Bioinformatics. ISSN 1367-4803 (Public Dataset)
Abstract
Motivation: Read alignment is central to many aspects of modern genomics. Most aligners use heuristics to accelerate processing, but these heuristics can fail to find the optimal alignments of reads. Alignment accuracy is typically measured through simulated reads; however, the simulated location may not be the (only) location with the optimal alignment score. Results: Vargas implements a heuristic-free algorithm guaranteed to find the highest-scoring alignment for real sequencing reads to a linear or graph genome. With semiglobal and local alignment modes and affine gap and quality-scaled mismatch penalties, it can implement the scoring functions of commonly used aligners to calculate optimal alignments. While this is computationally intensive, Vargas uses multi-core parallelization and vectorized (SIMD) instructions to make it practical to optimally align large numbers of reads, achieving a maximum speed of 456 billion cell updates per second. We demonstrate how these "gold standard" Vargas alignments can be used to improve heuristic alignment accuracy by optimizing command-line parameters in Bowtie 2, BWA-MEM, and vg to align more reads correctly.
Item Type: | Paper |
---|---|
Subjects: | bioinformatics > genomics and proteomics > alignment bioinformatics bioinformatics > genomics and proteomics bioinformatics > genomics and proteomics > Validation and Standardization bioinformatics > computational biology > algorithms bioinformatics > computational biology |
CSHL Authors: | |
Communities: | CSHL labs > Schatz lab |
Depositing User: | Adrian Gomez |
Date: | 22 April 2020 |
Date Deposited: | 23 Apr 2020 14:19 |
Last Modified: | 29 Jan 2024 21:00 |
PMCID: | PMC7320598 |
Related URLs: | |
Dataset ID: |
|
URI: | https://repository.cshl.edu/id/eprint/39342 |
Actions (login required)
Administrator's edit/view item |