原书出处
Introduction to Algorithms, Fourth Edition
32 第32章 字符串匹配
in a text T in O(n) matching time, where n = |T|. ★ 32.4 The Knuth-Morris-Pratt algorithm
Knuth, Morris, and Pratt developed a linear-time string matching algorithm that avoids computing the transition function δ altogether. Instead, the KMP algorithm uses an auxiliary function π, which it precomputes from the pattern in Θ(m) time and stores in an array π[1:m]. The array π allows the algorithm to compute the transition function δ efficiently (in an amortized sense) “on the fly” as needed. Loosely speaking, for any state q = 0, 1,
…, m and any character a ∈ ∑, the value π[q] contains the information needed to compute δ
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter032.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea