Longest Common Extension with RecompressionTomohiro I
Kyushu Institute of Technology, Japantomohiro@ai.kyutech.ac.jpAbstractGiven two positions i and j in a string T of length N , a longest common extension (LCE) query
asks for the length of the longest common prefix between suffixes beginning at i and j. A compressed
LCE data structure is a data structure that stores T in a compressed form while supporting fast LCE
queries. In this article we show that the recompression technique is a powerful
