Evidence map›Paper›PMID 32321164›Full record

ArticleBioinformatics (Oxford, England)2020

Vargas: heuristic-free alignment for assessing linear and graph read aligners.

Charlotte A Darby, Ravi Gaddipati, Michael C Schatz, Ben Langmead

Abstract read
In one paragraph

Article in Bioinformatics (Oxford, England), 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 11 papers.

0numbers the graph read from it
0cells of the map it votes in
11citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

11 citing papers in PubMed.

  1. Article
  2. Article
  3. Review
  4. Article
  5. Article
  6. Article
  7. Article
  8. Performance optimization in DNA short-read alignment.Bioinformatics (Oxford, England) · 2022
    Review
  9. Article
  10. Population-scale genotyping of structural variation in the era of long-read sequencing.Computational and structural biotechnology journal · 2022
    Review
  11. A variant selection framework for genome graphs.Bioinformatics (Oxford, England) · 2021
    Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Charlotte A DarbyDepartment of Computer Science.
Ravi GaddipatiDepartment of Biomedical Engineering.
Michael C SchatzDepartment of Computer Science.
Ben LangmeadDepartment of Computer Science.

Funding

Hardening and Scaling Core Genomics SoftwareR01GM118568 · NIGMS · JOHNS HOPKINS UNIVERSITY · PI LANGMEAD, BENJAMIN THOMAS · 2016 to 2020
$2.0M
Somatic variant calling and phasing using colored de Bruijn graphs in heterogeneous tumorsR21CA220411 · NCI · NEW YORK GENOME CENTER · PI NARZISI, GIUSEPPE · 2018 to 2019
$355k
NCI NIH HHS R21 CA220411NIGMS NIH HHS R01 GM118568
6 · The paper itself

Abstract

motivationRead 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.

resultsVargas 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-maximal exact match and vg to align more reads correctly. AVAILABILITY AND IMPLEMENTATION: Source code implemented in C++ and compiled binary releases are available at https://github.com/langmead-lab/vargas under the MIT license. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

Indexed as

HeuristicsHigh-Throughput Nucleotide SequencingAlgorithmsGenomicsSequence Analysis, DNASoftware

Identifiers

PMID32321164
PMCPMC7320598

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.