Optimal Substring Equality Queries with Applications to Sparse Text Indexing

DOI10.1145/3426870OpenAlexW3116090636MaRDI QIDQ5028344FDOQ5028344

Authors: 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

Recommendations

• In-place sparse suffix sorting
• Sparse text indexing in small space
• Sparse suffix tree construction in small space
• Sparse suffix tree construction in optimal time and space
• Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching

zbMATH Keywords

in-placesuffix sortingsubstring equality queries

Mathematics Subject Classification ID

Computer science (68-XX)

Cited In (2)

• Title not available (Why is that?)
• Sparse suffix and LCP array: simple, direct, small, and fast

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

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