Computational graph pangenomics: a tutorial on data structures and their applications

Publication date 16 February 2024

Cites work

scientific article; zbMATH DE number 1945170 (Why is no real title available?)
scientific article; zbMATH DE number 2203240 (Why is no real title available?)
scientific article; zbMATH DE number 2226805 (Why is no real title available?)
scientific article; zbMATH DE number 7695999 (Why is no real title available?)
Algorithms on Strings, Trees and Sequences
An extension of the Burrows-Wheeler transform
Approximate All-Pairs Suffix/Prefix Overlaps
Compressing and indexing labeled trees, with applications
Fully functional suffix trees and optimal text searching in BWT-runs bounded space
Indexing compressed text
Indexing variation graphs
LZ77 computation based on the run-length encoded BWT
Multicriteria Optimization
On compressing and indexing repetitive sequences
PFP Compressed Suffix Trees
Permuted Longest-Common-Prefix Array
Refining the \(r\)-index
Replacing suffix trees with enhanced suffix arrays
Suffix Arrays: A New Method for On-Line String Searches
Walk-preserving transformation of overlapped sequence graphs into blunt sequence graphs with GetBlunted
Wheeler graphs: a framework for BWT-based data structures

Cited in

(3)

Sequence to graph alignment using gap-sensitive co-linear chaining
Can formal languages help pangenomics to represent and analyze multiple genomes?
From de Bruijn graphs to variation graphs -- relationships between pangenome models

This page was built for publication: Computational graph pangenomics: a tutorial on data structures and their applications