Function noLZSS::lcp

• Defined in File factorizer_helpers.hpp

Function Documentation

inline size_t noLZSS::lcp(const cst_t &cst, size_t i, size_t j)

Computes the longest common prefix between two suffixes.

Uses the suffix tree’s LCA (Lowest Common Ancestor) to efficiently compute the length of the longest common prefix between suffixes starting at positions i and j.

Parameters:

• cst – The compressed suffix tree

• i – Starting position of first suffix

• j – Starting position of second suffix

Returns:

Length of the longest common prefix