Range LCP

DOI10.1016/j.jcss.2014.02.010zbMath1410.68414OpenAlexW4205723729MaRDI QIDQ5920340

Gad M. Landau, Amihood Amir, Alberto Apostolico, Moshe Lewenstein, Avivit Levy, Ely Porat

Publication date: 10 June 2014

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2014.02.010

zbMATH Keywords

data structurespattern matchingLCP

Mathematics Subject Classification ID

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

Related Items (5)

Computing minimal and maximal suffixes of a substring ⋮ Range Minimum Query Indexes in Higher Dimensions ⋮ 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

Cites Work

• Optimal off-line detection of repetitions in a string
• On-line construction of suffix trees
• Fast Algorithms for Finding Nearest Common Ancestors
• Mergeable Dictionaries
• A Space-Economical Suffix Tree Construction Algorithm
• On the Complexity of Finite Sequences
• Design and implementation of an efficient priority queue
• Fast parallel and serial approximate string matching
• Orthogonal range searching on the RAM, revisited
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Range LCP