LCP Accelerated Suffix Search
LCP Accelerated Suffix Search LCP accelerated suffix search improves suffix array binary search by using the Longest Common Prefix information to avoid repeated character comparisons. Instead of comparing the pattern against suffixes from scratch at every step, the algorithm reuses previously computed prefix matches. Problem Given a text $T$, suffix array SA , LCP array LCP , and a pattern $P$, determine whether $P$ occurs in $T$. Return true if...