Sparse Suffix Tree Construction in Optimal Time and Space

DOI10.1137/1.9781611974782.27zbMath1410.68099arXiv1608.00865OpenAlexW2953348849WikidataQ56485243 ScholiaQ56485243MaRDI QIDQ4575764

Paweł Gawrychowski, Tomasz Kociumaka

Publication date: 16 July 2018

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Data structures (68P05) Algorithms on strings (68W32)

Related Items (4)

Strictly in-place algorithms for permuting and inverting permutations ⋮ Tight lower bounds for the longest common extension problem ⋮ Universal compressed text indexing ⋮ Practical Performance of Space Efficient Data Structures for Longest Common Extensions.

This page was built for publication: Sparse Suffix Tree Construction in Optimal Time and Space