Longest Common Extensions in Trees

/ Authors

Philip Bille, Paweł Gawrychowski, Inge Li Gørtz, G. M. Landau, Oren Weimann

/ 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.

DOI: 10.1007/978-3-319-19929-0_5

Longest Common Extensions in Trees

/ Authors

Philip Bille, Paweł Gawrychowski, Inge Li Gørtz, G. M. Landau, Oren Weimann

/ 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.

DOI: 10.1007/978-3-319-19929-0_5