Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction

DOI10.4230/LIPIcs.CPM.2016.1zbMath1380.68161arXiv1601.07670OpenAlexW2963987971MaRDI QIDQ5369533

Simon J. Puglisi, Masayuki Takeda, Yuka Tanimura, Hideo Bannai, Shunsuke Inenaga, Tomohiro I.

Publication date: 17 October 2017

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

zbMATH Keywords

longest common prefixlongest common extensionsparse suffix array

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items (4)

Tight lower bounds for the longest common extension problem ⋮ Internal shortest absent word queries in constant time and linear space ⋮ Practical Performance of Space Efficient Data Structures for Longest Common Extensions. ⋮ Small-space LCE data structure with constant-time queries

This page was built for publication: Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction