Optimal Substring Equality Queries with Applications to Sparse Text Indexing

DOI10.1145/3426870MaRDI QIDQ5028344zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

in-placesubstring equality queriessuffix sorting

Mathematics Subject Classification ID

Computer science (68-XX)

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

Cited in

(5)

• scientific article; zbMATH DE number 6850405 (Why is no real title available?)
• Sparse suffix and LCP array: simple, direct, small, and fast
• Construction of sparse suffix trees and LCE indexes in optimal time and space
• Longest common extensions with wildcards: trade-off and applications
• 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)