An analytical comparison of two string searching algorithms
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3815356 (Why is no real title available?)
- scientific article; zbMATH DE number 3684587 (Why is no real title available?)
- scientific article; zbMATH DE number 3690676 (Why is no real title available?)
- scientific article; zbMATH DE number 3752234 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- Fast Pattern Matching in Strings
- String overlaps, pattern matching, and nontransitive games
Cited in
(12)- Average running time of the Boyer-Moore-Horspool algorithm
- scientific article; zbMATH DE number 140461 (Why is no real title available?)
- Optimal pattern matching algorithms
- Irredundant intervals
- scientific article; zbMATH DE number 17821 (Why is no real title available?)
- String matching algorithms and automata
- scientific article; zbMATH DE number 3976359 (Why is no real title available?)
- An analysis of the Karp-Rabin string matching algorithm
- Designing optimal- and fast-on-average pattern matching algorithms
- A fast string searching algorithm
- scientific article; zbMATH DE number 3883604 (Why is no real title available?)
- scientific article; zbMATH DE number 3943041 (Why is no real title available?)
This page was built for publication: An analytical comparison of two string searching algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q800732)