Locally Consistent Parsing for Text Indexing in Small Space

DOI10.1137/1.9781611975994.37OpenAlexW2902369435MaRDI QIDQ5146805

Shay Golan, Or Birenzwige, Ely Porat

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.00359

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items

Strictly in-place algorithms for permuting and inverting permutations, Extracting the sparse longest common prefix array from the suffix binary search tree, Internal shortest absent word queries in constant time and linear space, Near-optimal search time in \(\delta \)-optimal space, and vice versa, Near-optimal search time in \(\delta \)-optimal space, Near-optimal quantum algorithms for string problems, Practical Performance of Space Efficient Data Structures for Longest Common Extensions., Quasi-Linear-Time Algorithm for Longest Common Circular Factor