Speeding up two string-matching algorithms
From MaRDI portal
Cites work
- A Correct Preprocessing Algorithm for Boyer–Moore String-Searching
- A fast string searching algorithm
- A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm
- A variation on the Boyer-Moore algorithm
- Average running time of the Boyer-Moore-Horspool algorithm
- Fast Pattern Matching in Strings
- scientific article; zbMATH DE number 432823 (Why is no real title available?)
- scientific article; zbMATH DE number 52889 (Why is no real title available?)
- scientific article; zbMATH DE number 1142294 (Why is no real title available?)
- On improving the worst case running time of the Boyer-Moore string matching algorithm
- The Boyer–Moore–Galil String Searching Strategies Revisited
- The Complexity of Pattern Matching for a Random String
- The smallest automaton recognizing the subwords of a text
- Transducers and repetitions
Cited in
(37)- Fast parameterized matching with \(q\)-grams
- Constant-space string-matching in sublinear average time
- Asymptotic estimation of the average number of terminal states in DAWGs
- Saving comparisons in the Crochemore-Perrin string-matching algorithm
- An algorithm to compute the character access count distribution for pattern matching algorithms
- The wide window string matching algorithm
- Average complexity of exact and approximate multiple string matching
- Efficient online string matching based on characters distance text sampling
- A brief history of parameterized matching problems
- Fast string matching for DNA sequences
- Bit-parallel (\(\delta ,\gamma\))-matching and suffix automata
- Improved characters distance sampling for online and offline text searching
- On-line string matching algorithms: survey and experimental results
- NR-grep: A fast and flexible pattern-matching tool
- A very fast string matching algorithm based on condensed alphabets
- Tight bounds on the complexity of the Apostolico-Giancarlo algorithm
- Worst case efficient single and multiple string matching in the RAM model
- Tuning the Zhu-Takaoka string matching algorithm and experimental results.
- A SPACE EFFICIENT BIT-PARALLEL ALGORITHM FOR THE MULTIPLE STRING MATCHING PROBLEM
- Accelerating Boyer Moore Searches on Binary Texts
- Efficient variants of the backward-oracle-matching algorithm
- Fast and flexible packed string matching
- String matching with alphabet sampling
- Average complexity of backward \(q\)-gram string matching algorithms
- A New String Matching Algorithm
- Worst-case efficient single and multiple string matching on packed texts in the word-RAM model
- Linear and efficient string matching algorithms based on weak factor recognition
- A Bit-Parallel Exact String Matching Algorithm for Small Alphabet
- Fast Average-Case Pattern Matching on Weighted Sequences
- THE DESIGN PRINCIPLES AND ALGORITHMS OF A WEIGHTED GRAMMAR LIBRARY
- Light-based string matching
- Accelerating Boyer-Moore searches on binary texts
- Efficient parameterized string matching
- A unifying look at the Apostolico--Giancarlo string-matching algorithm
- Practical and flexible pattern matching over Ziv-Lempel compressed text.
- A simple fast hybrid pattern-matching algorithm
- A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms
This page was built for publication: Speeding up two string-matching algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1336956)
