A linear space data structure for range LCP queries

DOI10.3233/FI-2018-1741MaRDI QIDQ4611212zbMATH OpenOpenAlexFDO

Authors Arnab Ganguly, Manish Patil, Rahul Shah, 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

range querystring algorithmssuffix trees

Mathematics Subject Classification ID

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

Recommendations

• A linear-space data structure for range-LCP queries in poly-logarithmic time
• Faster range LCP queries
• A linear-space data structure for range-LCP queries in poly-logarithmic time
• Range LCP
• Range LCP

Cited in

(9)

• Internal shortest absent word queries in constant time and linear space
• Faster range LCP queries
• Range LCP
• A linear-space data structure for range-LCP queries in poly-logarithmic time
• A linear-space data structure for range-LCP queries in poly-logarithmic time
• Range LCP
• Linear space adaptive data structures for planar range reporting
• Range shortest unique substring queries
• Wee LCP

This page was built for publication: A linear space data structure for range LCP queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4611212)