A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms
From MaRDI portal
Publication:988198
DOI10.1016/j.scico.2010.04.012zbMath1209.68170OpenAlexW2067216917MaRDI QIDQ988198
Loek Cleophas, Bruce W. Watson, Gerard Zwaan
Publication date: 26 August 2010
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.scico.2010.04.012
Searching and sorting (68P10) Nonnumerical algorithms (68W05) Formal languages and automata (68Q45) Pattern recognition, speech recognition (68T10)
Related Items (4)
On modification of Boyer-Moore-Horspool's algorithm for tree pattern matching in linearised trees ⋮ Improved and self-tuned occurrence heuristics ⋮ BLIM: A new bit-parallel pattern matching algorithm overcoming computer word size limitation ⋮ A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms
Uses Software
Cites Work
- A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms
- An algorithm for approximate membership checking with application to password security
- Speeding up two string-matching algorithms
- Fast practical multi-pattern matching
- A taxonomy of sublinear multiple keyword pattern matching algorithms
- A fast string searching algorithm
- Efficient string matching
- Fast Pattern Matching in Strings
- Jewels of Stringology
- String Processing and Information Retrieval
- Algorithms on Strings
- Fast and flexible string matching by combining bit-parallelism and suffix automata
- COMBINATORIAL CHARACTERIZATION OF THE LANGUAGE RECOGNIZED BY FACTOR AND SUFFIX ORACLES
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms