Reference flow: reducing reference bias using multiple population genomes
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 …
genome, but failure to account for genetic variation leads to reference bias and confounding …
Pandora: nucleotide-resolution bacterial pan-genomics with reference graphs
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 …
variants across the full bacterial pan-genome. As much bacterial adaptability hinges on the …
Linear time construction of indexable founder block graphs
We introduce a compact pangenome representation based on an optimal segmentation
concept that aims to reconstruct founder sequences from a multiple sequence alignment …
concept that aims to reconstruct founder sequences from a multiple sequence alignment …
[HTML][HTML] Elastic founder graphs improved and enhanced
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 …
al.(2022)[14] developed the Elastic Founder Graph (EFG) representing an alignment of m …
Founder reconstruction enables scalable and seamless pangenomic analysis
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 …
standard elementary genomic analysis routine for resequencing projects. Various ways to …
Algorithms and complexity on indexing founder graphs
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 …
that unless the Orthogonal Vectors Hypothesis (OVH) is false, one cannot solve this problem …
Algorithms and complexity on indexing elastic founder graphs
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 …
that unless the Orthogonal Vectors Hypothesis (OVH) is false, one cannot solve this problem …
Linear time construction of indexable elastic founder graphs
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 …
importance in genomics applications. Unfortunately, even the simplest problem of deciding if …
Indexable elastic founder graphs of minimum height
Indexable elastic founder graphs have been recently proposed as a data structure for
genomics applications supporting fast pattern matching queries. Consider segmenting a …
genomics applications supporting fast pattern matching queries. Consider segmenting a …
Reducing reference bias using multiple population reference genomes
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 …
genome. But failure to account for genetic variation causes reference bias and confounding …