Computational graph pangenomics: a tutorial on data structures and their applications
From MaRDI portal
Publication:6155034
DOI10.1007/S11047-022-09882-6OpenAlexW4220680041MaRDI QIDQ6155034FDOQ6155034
Authors: Jasmijn A. Baaijens, Paola Bonizzoni, Christina Boucher, Gianluca Della Vedova, Yuri Pirola, Raffaella Rizzi, Jouni Sirén 
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
Cites Work
- Algorithms on Strings, Trees and Sequences
- Multicriteria Optimization
- Compressing and indexing labeled trees, with applications
- Indexing compressed text
- Title not available (Why is that?)
- Suffix Arrays: A New Method for On-Line String Searches
- On compressing and indexing repetitive sequences
- Permuted Longest-Common-Prefix Array
- An extension of the Burrows-Wheeler transform
- Replacing suffix trees with enhanced suffix arrays
- Approximate All-Pairs Suffix/Prefix Overlaps
- LZ77 computation based on the run-length encoded BWT
- Wheeler graphs: a framework for BWT-based data structures
- Fully functional suffix trees and optimal text searching in BWT-runs bounded space
- Indexing variation graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Walk-preserving transformation of overlapped sequence graphs into blunt sequence graphs with GetBlunted
- Refining the \(r\)-index
- PFP Compressed Suffix Trees
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: Computational graph pangenomics: a tutorial on data structures and their applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6155034)
