Optimal Substring Equality Queries with Applications to Sparse Text Indexing

DOI10.1145/3426870OpenAlexW3116090636MaRDI QIDQ5028344

Nicola Prezza

Publication date: 8 February 2022

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

in-placesuffix sortingsubstring equality queries

Mathematics Subject Classification ID

Computer science (68-XX)

This page was built for publication: Optimal Substring Equality Queries with Applications to Sparse Text Indexing