原书出处
Introduction to Algorithms, Fourth Edition
32 第32章 字符串匹配
IX-ARRAY: if SA[i] = j, then rank[j] = i. That is, we have rank[SA[i]] = i for i = 1, 2, …
, n. For a suffix T[i:], the value of rank[i] gives the position of this suffix in the lexicographically sorted order. Figure 32.11 includes the rank array for the ratatat example. For example, the suffix tat is T[5:]. To find this suffix’s position in the sorted order, look up rank[5] = 6. To compute the LCP array, we will need to
determine where in the lexicographically sorted order a suffix appears, but with its firs
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter032.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea