Evidence map›Paper›PMID 34412679›Full record

ArticleGenome biology2021

VariantStore: an index for large-scale genomic variant search.

Prashant Pandey, Yinjie Gao, Carl Kingsford

Abstract read
In one paragraph

Article in Genome biology, 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 5 papers.

0numbers the graph read from it
0cells of the map it votes in
5citing 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

5 citing papers in PubMed.

  1. Article
  2. Improving Hi-C contact matrices using genome graphs.bioRxiv : the preprint server for biology · 2023
    Article
  3. Article
  4. Article
  5. 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

3 authors.

Prashant PandeyComputational Biology Department, School of Computer Science, Carnegie Mellon University, Pittsburgh, USA.
Yinjie GaoComputational Biology Department, School of Computer Science, Carnegie Mellon University, Pittsburgh, USA.
Carl KingsfordComputational Biology Department, School of Computer Science, Carnegie Mellon University, Pittsburgh, USA. carlk@cs.cmu.edu.ORCID 0000-0002-0118-5516

Funding

Data Discovery: Computational Methods for Searching Short-Read Sequencing Experiments - Administrative SupplementR01GM122935 · NIGMS · CARNEGIE-MELLON UNIVERSITY · PI KINGSFORD, CARLETON LEE · 2017 to 2021
$1.2M
NIGMS NIH HHS R01 GM122935
6 · The paper itself

Abstract

Efficiently scaling genomic variant search indexes to thousands of samples is computationally challenging due to the presence of multiple coordinate systems to avoid reference biases. We present VariantStore, a system that indexes genomic variants from multiple samples using a variation graph and enables variant queries across any sample-specific coordinate system. We show the scalability of VariantStore by indexing genomic variants from the TCGA project in 4 h and the 1000 Genomes project in 3 h. Querying for variants in a gene takes between 0.002 and 3 seconds using memory only 10% of the size of the full representation.

Indexed as

GenomicsSoftwareAlgorithmsGenome, HumanHumansGraph genomesPangenomesVariation graph

Identifiers

PMID34412679
PMCPMC8375130

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.