ArticleGenome research2023
Extremely fast construction and querying of compacted and colored de Bruijn graphs with GGCAT.
Article in Genome research, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 29 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
29 citing papers in PubMed.
- RSHash: a fast and space-efficient hash table for k-mers.Bioinformatics (Oxford, England) · 2026Article
- Optimizing sparse and skew hashing: faster k-mer dictionaries.Bioinformatics (Oxford, England) · 2026Article
- Building and applying pangenome references to capture genetic diversity.Nature reviews. Genetics · 2026Review
- Hash functions in nucleotide sequence analysis.Genome research · 2026Review
- Leveraging spectrum of graph sheaf Laplacian as a genome-architecture-aware measure of microbiome diversity.bioRxiv : the preprint server for biology · 2026Article
- Optimizing sparse and skew hashing: fasterbioRxiv : the preprint server for biology · 2026Article
- Elucidating Transitions ofJournal of computational biology : a journal of computational molecular cell biology · 2026Article
- FroM Superstring to Indexing: a space-efficient index for unconstrainedBioinformatics advances · 2026Article
- DVOUG enables robust DNA sequence assembly and reconstruction with a dynamic, variable-order graph.Cell reports methods · 2025Article
- Article
- Prokrustean Graph: A substring index for rapid k-mer size analysis.bioRxiv : the preprint server for biology · 2025Article
- The open-closed mod-minimizer algorithm.Algorithms for molecular biology : AMB · 2025Article
- MUSET: set of utilities for constructing abundance unitig matrices from sequencing data.Bioinformatics (Oxford, England) · 2025Article
- Fast and Scalable Parallel External-Memory Construction of Colored Compacted de Bruijn Graphs with Cuttlefish 3.bioRxiv : the preprint server for biology · 2025Article
- The backpack quotient filter: A dynamic and space-efficient data structure for queryingiScience · 2024Article
- When less is more: sketching with minimizers in genomics.Genome biology · 2024Review
- Graphite: painting genomes using a colored de Bruijn graph.NAR genomics and bioinformatics · 2024Article
- Pangenome-spanning epistasis and coselection analysis via de Bruijn graphs.Genome research · 2024Article
- Compression algorithm for colored de Bruijn graphs.Algorithms for molecular biology : AMB · 2024Article
- Indexing and real-time user-friendly queries in terabyte-sized complex genomic datasets with kmindex and ORA.Nature computational science · 2024Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
2 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
Compacted de Bruijn graphs are one of the most fundamental data structures in computational genomics. Colored compacted de Bruijn graphs are a variant built on a
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.