Two Way algorithm

(algorithm)

Definition: Partition ("factor") the pattern, x, into left, x_l, and right, x_r, parts in such a way to optimize searching. Compare x_r left to right then, if it matches, compare x_l right to left.

Generalization (I am a kind of ...)
string matching algorithm.

Note: It "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."

Author: PEB

Implementation

Christian Charras' and Thierry Lecroq's Exact String Matching Algorithms (C)

More information

Maxime Crochemore and Dominique Perrin, Two-way string-matching, Journal of the ACM, 38(3):651-675, July 1991.

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 24 August 2017.
HTML page formatted Wed Mar 13 12:42:46 2019.

Cite this as:
Paul E. Black, "Two Way algorithm", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 24 August 2017. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/twoWay.html