← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

32 第32章 字符串匹配

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.766Z

der: rank[SA[i]] = i for i = 1, 2, …, n. The rank array is used to compute the LCP array.

A suffix array is simply a compact way to represent the lexicographically sorted order of all n suffixes of a length-n text. Given a text T[1:n], let T[i:] denote the suffix T[i:n]. The suffix array SA[1:n] of T is defined such that if SA[i] = j, then T[j:] is the ith suffix of T in lexicographic order.3 That is, the ith suffix of T in lexicographic order is T[

SA[i]:]. Along with the suffix array, another useful array is the longest common prefix ar

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter032.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea