ArticleBioinformatics (Oxford, England)2023
Chaining for accurate alignment of erroneous long reads to acyclic variation graphs.
Article in Bioinformatics (Oxford, England), 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 13 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
13 citing papers in PubMed.
- LCPAN: efficient variation graph construction using locally consistent parsing.Genome biology · 2026Article
- Rapid, accurate long- and short-read mapping to large pangenome graphs with vg Giraffe.Research square · 2025Article
- Rapid, accurate long- and short-read mapping to large pangenome graphs with vg Giraffe.bioRxiv : the preprint server for biology · 2025Article
- Exploiting uniqueness: seed-chain-extend alignment on elastic founder graphs.Bioinformatics (Oxford, England) · 2025Article
- Review
- A survey of sequence-to-graph mapping algorithms in the pangenome era.Genome biology · 2025Review
- Haplotype-aware sequence alignment to pangenome graphs.Genome research · 2024Article
- Label-guided seed-chain-extend alignment on annotated De Bruijn graphs.Bioinformatics (Oxford, England) · 2024Article
- Technological Development and Advances for Constructing and Analyzing Plant Pangenomes.Genome biology and evolution · 2024Review
- Finding maximal exact matches in graphs.Algorithms for molecular biology : AMB · 2024Article
- Co-linear chaining on pangenome graphs.Algorithms for molecular biology : AMB · 2024Article
- Maximum-scoring path sets on pangenome graphs of constant treewidth.Frontiers in bioinformatics · 2024Article
- Aligning distant sequences to graphs using long seed sketches.Genome research · 2023Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
5 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
motivationAligning reads to a variation graph is a standard task in pangenomics, with downstream applications such as improving variant calling. While the vg toolkit [Garrison et al. (Variation graph toolkit improves read mapping by representing genetic variation in the reference. Nat Biotechnol 2018;36:875-9)] is a popular aligner of short reads, GraphAligner [Rautiainen and Marschall (GraphAligner: rapid and versatile sequence-to-graph alignment. Genome Biol 2020;21:253-28)] is the state-of-the-art aligner of erroneous long reads. GraphAligner works by finding candidate read occurrences based on individually extending the best seeds of the read in the variation graph. However, a more principled approach recognized in the community is to co-linearly chain multiple seeds.
resultsWe present a new algorithm to co-linearly chain a set of seeds in a string labeled acyclic graph, together with the first efficient implementation of such a co-linear chaining algorithm into a new aligner of erroneous long reads to acyclic variation graphs, GraphChainer. We run experiments aligning real and simulated PacBio CLR reads with average error rates 15% and 5%. Compared to GraphAligner, GraphChainer aligns 12-17% more reads, and 21-28% more total read length, on real PacBio CLR reads from human chromosomes 1, 22, and the whole human pangenome. On both simulated and real data, GraphChainer aligns between 95% and 99% of all reads, and of total read length. We also show that minigraph [Li et al. (The design and construction of reference pangenome graphs with minigraph. Genome Biol 2020;21:265-19.)] and minichain [Chandra and Jain (Sequence to graph alignment using gap-sensitive co-linear chaining. In: Proceedings of the 27th Annual International Conference on Research in Computational Molecular Biology (RECOMB 2023). Springer, 2023, 58-73.)] obtain an accuracy of <60% on this setting. AVAILABILITY AND IMPLEMENTATION: GraphChainer is freely available at https://github.com/algbio/GraphChainer. The datasets and evaluation pipeline can be reached from the previous address.
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.