Year: 1991
Type: article
Abstract: A new string-matching algorithm is presented, which can be viewed as an intermediate between the classical algorithms of Knuth, Morris, and Pratt on the one hand and Boyer and Moore, on the other hand.The algorithm is linear in time and uses constant space as the algorithm of Galil and Seiferas.It presents the advantage of being remarkably simple which consequently makes its analysis possible.The algorithm relies on a previously known result in combinatorics on words, called the Critical Factorization Theorem, which relates the global period of a word to Its local repetitions of blocks Categories and Subject Descriptors: D.
Source: Journal of the ACM
Authors: Maxime Crochemore, Dominique Perrin
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W2017497752