Sparse Text Indexing in Small Space

DOI10.1145/2836166zbMath1445.68063DBLPjournals/talg/Bille0GKSV16OpenAlexW2345228340WikidataQ60554356 ScholiaQ60554356MaRDI QIDQ4962616

Inge Li Gørtz, Benjamin Sach, Tsvi Kopelowitz, Philip Bille, Johannes Fischer, Hjalte Wedel Vildhøj

Publication date: 5 November 2018

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

Full work available at URL: https://doi.org/10.1145/2836166

zbMATH Keywords

sparse suffix sortingKarp-Rabin fingerprintssparse position heapsparse suffix arraysparse suffix treesparse text indexing

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Data structures (68P05) Algorithms on strings (68W32)

Related Items (2)

Extracting the sparse longest common prefix array from the suffix binary search tree ⋮ Practical Performance of Space Efficient Data Structures for Longest Common Extensions.

This page was built for publication: Sparse Text Indexing in Small Space