知识卡片

普通读书笔记卡 · 3707.a

最长公共前缀数组比较相邻后缀

理解等级:中级

LCP[i]记录后缀数组中第i个和前一个后缀的最长公共前缀长度;首项因没有前驱记0。相邻比较把后缀之间的重复信息压缩成数组,供重复子串等查询使用。

这张卡片看不懂?

已有反馈 · 0 / 10 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • 第32章 字符串匹配 · 查看原书依据

      Along with the suffix array, another useful array is the longest common prefix array LCPOE[1:n]. The entry LCP[i] gives the length of the longest common prefix between the ith and (i – 1)st suffixes in the sorted order (with LCP[SA[1]] defined to be 0, since there is no prefix lexicographically smaller than T[SA[1]:]). Figure 32.11 shows the

    参考来源

    - 位置:《算法导论(第4版)》第32章《字符串匹配》(OEBPS/chapter032.xhtml,文本字符[60000,65000))。 - 结论依据:原文第32.5节后缀数组、LCP和倍增构造的定义、示例或正确性推导。 - 原始内容:Along with the suffix array, another useful array is the longest common prefix array LCPOE [1: n ]. The entry LCP [ i ] gives the length of the longest common prefix between the i th and ( i – 1)st suffixes in the sorted order (with LCP [ SA [1]] defined to be 0, since there is no prefix lexicographically smaller than T [ SA [1]:]). Figure 32.11 shows the