3 - Pattern Matching
Published online by Cambridge University Press: 10 June 2021
Summary
The chapter deals with the most classical subject in text algorithm, namely text searching and string matching. There are several problems related to special tables occurring in fast patternmatching techniques: tables for borders, strict borders, good-suffixes, prefixes and short borders. Are also presented some versions of classical methods known as Knuth-Morris-Pratt and Boyer- Moore algorithms. Pattern matching is closely related to the computation of periods, maximal suffixes and critical positions in texts. Three problems are related to so-called non-standard stringology: parameterised and order-preserving pattern-matching. Also considered are pattern matching with errors and the related 2D-matching.
Keywords
- Type
- Chapter
- Information
- 125 Problems in Text Algorithmswith Solutions, pp. 53 - 110Publisher: Cambridge University PressPrint publication year: 2021