A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms
From MaRDI portal
(Redirected from Publication:988198)
Recommendations
Cites work
- scientific article; zbMATH DE number 3810891 (Why is no real title available?)
- scientific article; zbMATH DE number 3574936 (Why is no real title available?)
- scientific article; zbMATH DE number 3633757 (Why is no real title available?)
- scientific article; zbMATH DE number 1044854 (Why is no real title available?)
- scientific article; zbMATH DE number 1142294 (Why is no real title available?)
- scientific article; zbMATH DE number 1490002 (Why is no real title available?)
- scientific article; zbMATH DE number 1754502 (Why is no real title available?)
- scientific article; zbMATH DE number 1794216 (Why is no real title available?)
- scientific article; zbMATH DE number 194642 (Why is no real title available?)
- scientific article; zbMATH DE number 798342 (Why is no real title available?)
- A fast string searching algorithm
- A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms
- A taxonomy of sublinear multiple keyword pattern matching algorithms
- Algorithms on Strings
- An algorithm for approximate membership checking with application to password security
- COMBINATORIAL CHARACTERIZATION OF THE LANGUAGE RECOGNIZED BY FACTOR AND SUFFIX ORACLES
- Constructing factor oracles
- Efficient string matching
- Fast Pattern Matching in Strings
- Fast and flexible string matching by combining bit-parallelism and suffix automata
- Fast practical multi-pattern matching
- Jewels of Stringology
- Speeding up two string-matching algorithms
- String Processing and Information Retrieval
Cited in
(7)- 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
- A taxonomy of some right-to-left string-matching algorithms
- BLIM: A new bit-parallel pattern matching algorithm overcoming computer word size limitation
- String Processing and Information Retrieval
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)