A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms
From MaRDI portal
Publication:988198
DOI10.1016/J.SCICO.2010.04.012zbMATH Open1209.68170OpenAlexW2067216917MaRDI QIDQ988198FDOQ988198
Loek Cleophas, B. 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
Formal languages and automata (68Q45) Pattern recognition, speech recognition (68T10) Searching and sorting (68P10) Nonnumerical algorithms (68W05)
Cites Work
- Efficient string matching
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Jewels of Stringology
- Title not available (Why is that?)
- Speeding up two string-matching algorithms
- A fast string searching algorithm
- Fast Pattern Matching in Strings
- Title not available (Why is that?)
- An algorithm for approximate membership checking with application to password security
- Algorithms on Strings
- Title not available (Why is that?)
- Fast and flexible string matching by combining bit-parallelism and suffix automata
- Fast practical multi-pattern matching
- A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- COMBINATORIAL CHARACTERIZATION OF THE LANGUAGE RECOGNIZED BY FACTOR AND SUFFIX ORACLES
- A taxonomy of sublinear multiple keyword pattern matching algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- String Processing and Information Retrieval
Cited In (5)
- Improved and self-tuned occurrence heuristics
- On modification of Boyer-Moore-Horspool's algorithm for tree pattern matching in linearised trees
- A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms
- A taxonomy of sublinear multiple keyword pattern matching algorithms
- BLIM: A new bit-parallel pattern matching algorithm overcoming computer word size limitation
Uses Software
This page was built for publication: A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q988198)