A Linear Space Data Structure for Range LCP Queries*

DOI10.3233/FI-2018-1741zbMath1405.68463OpenAlexW2899518456MaRDI QIDQ4611212

Rahul Shah, Manish Patil, Arnab Ganguly, Sharma V. Thankachan

Publication date: 17 January 2019

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2018-1741

zbMATH Keywords

string algorithmsrange querysuffix trees

Mathematics Subject Classification ID

Data structures (68P05) Algorithms on strings (68W32)

Related Items (3)

Internal shortest absent word queries in constant time and linear space ⋮ Finding top-\(k\) longest palindromes in substrings ⋮ A linear-space data structure for range-LCP queries in poly-logarithmic time

This page was built for publication: A Linear Space Data Structure for Range LCP Queries*