Efficient variants of the backward-oracle-matching algorithm
From MaRDI portal
Recommendations
- Improving practical exact string matching
- Fast-search algorithms: new efficient variants of the Boyer-Moore pattern-matching algorithm
- Alternative algorithms for bit-parallel string matching.
- Fast and flexible string matching by combining bit-parallelism and suffix automata
- scientific article; zbMATH DE number 1982175
Cites work
- A fast string searching algorithm
- Fast exact string matching algorithms
- Fast Pattern Matching in Strings
- scientific article; zbMATH DE number 5725179 (Why is no real title available?)
- scientific article; zbMATH DE number 3792988 (Why is no real title available?)
- Speeding up two string-matching algorithms
- The Complexity of Pattern Matching for a Random String
- The smallest automaton recognizing the subwords of a text
Cited in
(16)- Fast string matching for DNA sequences
- On-line string matching in highly similar DNA sequences
- A very fast string matching algorithm based on condensed alphabets
- Fast Searching in Packed Strings
- Fast and flexible packed string matching
- Linear and efficient string matching algorithms based on weak factor recognition
- Boosting pattern matching performance via k-bit filtering
- String matching with lookahead
- Designing optimal- and fast-on-average pattern matching algorithms
- Faster string matching based on hashing and bit-parallelism
- A Bit-Parallel Exact String Matching Algorithm for Small Alphabet
- Fast searching in packed strings
- Fast and flexible string matching by combining bit-parallelism and suffix automata
- Parallel String Matching
- Alternative algorithms for bit-parallel string matching.
- Improving practical exact string matching
This page was built for publication: Efficient variants of the backward-oracle-matching algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3655531)
