Fast string matching for multiple searches
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1542846 (Why is no real title available?)
- scientific article; zbMATH DE number 828444 (Why is no real title available?)
- A comparison of three string matching algorithms
- A fast string searching algorithm
- A universal algorithm for sequential data compression
- Fast Pattern Matching in Strings
- Some perils of performance prediction: A case study on pattern matching
Cited in
(12)- Efficient pattern searching over large dictionaries
- Light-based string matching
- On character searching and replacing
- Exact pattern matching with feed-forward Bloom filters
- A new faster multi-pattern matching algorithm and design in IDS
- Tuning string matching for huge pattern sets
- Some perils of performance prediction: A case study on pattern matching
- Giant complete automaton for uncertain multiple string matching and its high speed construction algorithm
- An efficient substring search method by using delayed keyword extraction
- scientific article; zbMATH DE number 458995 (Why is no real title available?)
- A fast string searching algorithm
- scientific article; zbMATH DE number 3921984 (Why is no real title available?)
This page was built for publication: Fast string matching for multiple searches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2745228)