ArticleJournal of computational biology : a journal of computational molecular cell biology2020
Sparse Binary Relation Representations for Genome Graph Annotation.
Article in Journal of computational biology : a journal of computational molecular cell biology, 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 14 papers.
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.
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.
Who cites it
14 citing papers in PubMed.
- Kaminari: a frugal colored index for approximateBioinformatics advances · 2026Article
- Article
- Fast and Scalable Parallel External-Memory Construction of Colored Compacted de Bruijn Graphs with Cuttlefish 3.bioRxiv : the preprint server for biology · 2025Article
- BWT construction and search at the terabase scale.Bioinformatics (Oxford, England) · 2024Article
- Where the Patterns Are: Repetition-Aware Compression for Colored de Bruijn GraphsJournal of computational biology : a journal of computational molecular cell biology · 2024Article
- Fulgor: a fast and compact k-mer index for large-scale matching and color queries.Algorithms for molecular biology : AMB · 2024Article
- Themisto: a scalable colored k-mer index for sensitive pseudoalignment against hundreds of thousands of bacterial genomes.Bioinformatics (Oxford, England) · 2023Article
- Fulgor: A fast and compactbioRxiv : the preprint server for biology · 2023Article
- Space-efficient representation of genomic k-mer count tables.Algorithms for molecular biology : AMB · 2022Article
- Succinct dynamic de Bruijn graphs.Bioinformatics (Oxford, England) · 2021Article
- Topology-based sparsification of graph annotations.Bioinformatics (Oxford, England) · 2021Article
- Data structures based onGenome research · 2021Review
- Article
- Building large updatable colored de Bruijn graphs via merging.Bioinformatics (Oxford, England) · 2019Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
6 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
High-throughput DNA sequencing data are accumulating in public repositories, and efficient approaches for storing and indexing such data are in high demand. In recent research, several graph data structures have been proposed to represent large sets of sequencing data and to allow for efficient querying of sequences. In particular, the concept of labeled de Bruijn graphs has been explored by several groups. Although there has been good progress toward representing the sequence graph in small space, methods for storing a set of labels on top of such graphs are still not sufficiently explored. It is also currently not clear how characteristics of the input data, such as the sparsity and correlations of labels, can help to inform the choice of method to compress the graph labeling. In this study, we present a new compression approach,
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
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.