Reference flow: reducing reference bias using multiple population genomes

NC Chen, B Solomon, T Mun, S Iyer, B Langmead - Genome biology, 2021 - Springer
Most sequencing data analyses start by aligning sequencing reads to a linear reference
genome, but failure to account for genetic variation leads to reference bias and confounding …

Pandora: nucleotide-resolution bacterial pan-genomics with reference graphs

RM Colquhoun, MB Hall, L Lima, LW Roberts… - Genome biology, 2021 - Springer
We present pandora, a novel pan-genome graph structure and algorithms for identifying
variants across the full bacterial pan-genome. As much bacterial adaptability hinges on the …

Linear time construction of indexable founder block graphs

V Mäkinen, B Cazaux, M Equi, T Norri… - arxiv preprint arxiv …, 2020 - arxiv.org
We introduce a compact pangenome representation based on an optimal segmentation
concept that aims to reconstruct founder sequences from a multiple sequence alignment …

[HTML][HTML] Elastic founder graphs improved and enhanced

N Rizzo, M Equi, T Norri, V Mäkinen - Theoretical Computer Science, 2024 - Elsevier
Indexing labeled graphs for pattern matching is a central challenge of pangenomics. Equi et
al.(2022)[14] developed the Elastic Founder Graph (EFG) representing an alignment of m …

Founder reconstruction enables scalable and seamless pangenomic analysis

T Norri, B Cazaux, S Dönges, D Valenzuela… - …, 2021 - academic.oup.com
Motivation Variant calling workflows that utilize a single reference sequence are the de facto
standard elementary genomic analysis routine for resequencing projects. Various ways to …

Algorithms and complexity on indexing founder graphs

M Equi, T Norri, J Alanko, B Cazaux, AI Tomescu… - Algorithmica, 2023 - Springer
We study the problem of matching a string in a labeled graph. Previous research has shown
that unless the Orthogonal Vectors Hypothesis (OVH) is false, one cannot solve this problem …

Algorithms and complexity on indexing elastic founder graphs

M Equi, T Norri, J Alanko, B Cazaux… - … on Algorithms and …, 2021 - researchportal.helsinki.fi
We study the problem of matching a string in a labeled graph. Previous research has shown
that unless the Orthogonal Vectors Hypothesis (OVH) is false, one cannot solve this problem …

Linear time construction of indexable elastic founder graphs

N Rizzo, V Mäkinen - International Workshop on Combinatorial Algorithms, 2022 - Springer
The pattern matching of strings in labeled graphs has been widely studied lately due to its
importance in genomics applications. Unfortunately, even the simplest problem of deciding if …

Indexable elastic founder graphs of minimum height

N Rizzo, V Mäkinen - Annual Symposium on …, 2022 - researchportal.helsinki.fi
Indexable elastic founder graphs have been recently proposed as a data structure for
genomics applications supporting fast pattern matching queries. Consider segmenting a …

Reducing reference bias using multiple population reference genomes

NC Chen, B Solomon, T Mun, S Iyer, B Langmead - BioRxiv, 2020 - biorxiv.org
Most sequencing data analyses start by aligning sequencing reads to a linear reference
genome. But failure to account for genetic variation causes reference bias and confounding …