Namespace MoreStructures.SuffixArrays.LongestCommonPrefix

Classes

MoreStructures.SuffixArrays.LongestCommonPrefix.

The LCP Array of a string S of length n is defined as an array LCP of length n - 1 such that LCP[i] is the length of the prefix in common between the suffixes starting at SA[i] and SA[i + 1], where SA is the Suffix Array of S, for each i from 0 to n - 1 excluded.

KasaiLcpArrayBuilder

An ILcpArrayBuilder implementation which uses the Kasai's algorithm (2001) to compute the LCP Array in linear time.

NaiveLcpArrayBuilder

An implementation of ILcpArrayBuilder which calculates the LCP Array using the definition.

Interfaces

ILcpArrayBuilder

An algorithm finding the Longest Common Prefix (LCP) Array of a string.