SPARE Parts: a C++ toolkit for string pattern recognition In this paper, we consider the design and implementation of SPARE Parts, a C++ toolkit for pattern matching. SPARE Parts (in particular, the 2003 version presented in this article) is the second generation string pattern matching toolkit by the authors. The toolkit, the first generic program for keyword pattern matching, contains implementations of the well-known Knuth–Morris–Pratt, Boyer–Moore, Aho–Corasick and Commentz–Walter algorithms (and their variants).
Keywords for this software
References in zbMATH (referenced in 5 articles )
Showing results 1 to 5 of 5.
- Watson, Bruce W.; Kourie, Derrick G.; Strauss, Tinus: A sequential recursive implementation of dead-zone single keyword pattern matching (2012)
- Cleophas, Loek; Watson, Bruce W.; Zwaan, Gerard: A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms (2010)
- Külekci, M. Oğuzhan: BLIM: A new bit-parallel pattern matching algorithm overcoming computer word size limitation (2010)
- Cleophas, Loek; Watson, Bruce W.; Zwaan, Gerard: Automaton-based sublinear keyword pattern matching (2004)
- Watson, Bruce W.; Cleophas, Loek: SPARE Parts: a C++ toolkit for string pattern recognition (2004) ioport