原书出处
Introduction to Algorithms, Fourth Edition
32 第32章 字符串匹配
r whether P[:k] is a suffix of P[:q]a on line 4 can require comparing up to m characters.
Much faster procedures exist. By utilizing some cleverly computed information about the pattern P (see Exercise 32.4-8), the time required to compute δ from P improves to O(m |∑|). This improved procedure for computing δ provides a way to find all occurrences of a length-m pattern in a length-n text over an alphabet ∑ with O(m |∑|) preprocessing time and Θ(n) matching time. Exercises 32.3-1 Draw a state-transition
diagram for the string-matching automaton for the pattern P = aabab over the alphabet ∑ =
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter032.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea