Solving the minimal positional substring cover problem in sublinear space

DOI10.4230/LIPICS.CPM.2024.12MaRDI QIDQ6891085zbMATH OpenFDO

Authors Paola Bonizzoni, Christina Boucher, Davide Cozzi, Travis Gagie, Yuri Pirola

Publication date 2 December 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.CPM.2024.12

zbMATH Keywords

\(r\)-indexminimal position substring coverpositional Burrows-Wheeler transformset-maximal exact matches

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites work

• Combinatorial Pattern Matching
• Data structures for SMEM-finding in the PBWT
• Fully functional suffix trees and optimal text searching in BWT-runs bounded space
• Haplotype threading using the positional Burrows-Wheeler transform
• scientific article; zbMATH DE number 6850405 (Why is no real title available?)
• MONI can find k-MEMs

This page was built for publication: Solving the minimal positional substring cover problem in sublinear space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891085)