A Black Box for Online Approximate Pattern Matching
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 3471577 (Why is no real title available?)
- scientific article; zbMATH DE number 2119723 (Why is no real title available?)
- scientific article; zbMATH DE number 1424324 (Why is no real title available?)
- Approximate string matching for music analysis
- Combinatorial Pattern Matching
- Combinatorial Pattern Matching
- Communication complexity of sum-type functions invariant under translation
- Data streams: algorithms and applications.
- Efficient 2-dimensional approximate matching of half-rectangular figures
- Efficient string matching with k mismatches
- Faster algorithms for string matching with k mismatches
- Faster image template matching in the sum of the absolute value of differences measure
- Generalized String Matching
- Simple deterministic wildcard matching
- Verifying candidate matches in sparse and wildcard matching
- k-Mismatch with Don’t Cares
Cited in
(5)
This page was built for publication: A Black Box for Online Approximate Pattern Matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3506949)