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

DOI10.1007/s11047-022-09882-6OpenAlexW4220680041MaRDI QIDQ6155034

Paola Bonizzoni, Jouni Sirén, Yuri Pirola, Gianluca Della Vedova, Christina Boucher, Raffaella Rizzi, Jasmijn A. Baaijens

Publication date: 16 February 2024

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-022-09882-6

Mathematics Subject Classification ID

Genetics and epigenetics (92D10) Data structures (68P05)

Related Items (2)

Can formal languages help pangenomics to represent and analyze multiple genomes? ⋮ Sequence to graph alignment using gap-sensitive co-linear chaining

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On compressing and indexing repetitive sequences
• LZ77 computation based on the run-length encoded BWT
• Replacing suffix trees with enhanced suffix arrays
• Wheeler graphs: a framework for BWT-based data structures
• Walk-preserving transformation of overlapped sequence graphs into blunt sequence graphs with GetBlunted
• Refining the \(r\)-index
• An extension of the Burrows-Wheeler transform
• Suffix Arrays: A New Method for On-Line String Searches
• Compressing and indexing labeled trees, with applications
• Indexing compressed text
• Approximate All-Pairs Suffix/Prefix Overlaps
• Permuted Longest-Common-Prefix Array
• Algorithms on Strings, Trees and Sequences
• Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space
• PFP Compressed Suffix Trees
• Indexing Variation Graphs
• Multicriteria Optimization

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