Simple Optimal String Matching Algorithm
From MaRDI portal
Publication:4500860
Recommendations
- scientific article; zbMATH DE number 1615293
- scientific article; zbMATH DE number 2247683
- Average-optimal string matching
- scientific article; zbMATH DE number 1303588
- Approximate String Matching: A Simpler Faster Algorithm
- An approximate string-matching algorithm
- Simple and efficient string matching with k mismatches
- An 0(1) time algorithm for string matching
Cited in
(18)- scientific article; zbMATH DE number 3976359 (Why is no real title available?)
- String matching with simple devices
- Optimal pattern matching algorithms
- Irredundant intervals
- scientific article; zbMATH DE number 1615293 (Why is no real title available?)
- Improved and self-tuned occurrence heuristics
- Average-optimal string matching
- scientific article; zbMATH DE number 2247683 (Why is no real title available?)
- An artificial neural network based approach for online string matching/filtering of large databases
- String-matching on ordered alphabets
- Average optimal string matching in packed strings
- String matching algorithms and automata
- Simple deterministic wildcard matching
- scientific article; zbMATH DE number 4135398 (Why is no real title available?)
- Designing optimal- and fast-on-average pattern matching algorithms
- THE DESIGN PRINCIPLES AND ALGORITHMS OF A WEIGHTED GRAMMAR LIBRARY
- A New String Matching Algorithm
- The wide window string matching algorithm
This page was built for publication: Simple Optimal String Matching Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4500860)