Longest Common Extensions in Trees
/ Authors
/ Abstract
The longest common extension (LCE) of two indices in a string is the length of the longest identical substrings starting at these two indices. The LCE problem asks to preprocess a string into a compact data structure that supports fast LCE queries.
Journal: Theor. Comput. Sci.