Analysis of two-dimensional approximate pattern matching algorithms
From MaRDI portal
Publication:1129016
Recommendations
Cites work
- Alphabet-Independent Two-Dimensional Witness Computation
- An Alphabet Independent Approach to Two-Dimensional Pattern Matching
- An Improved Algorithm For Approximate String Matching
- Data structures and algorithms for approximate string matching
- Efficient string matching
- Fast parallel and serial multidimensional approximate array matching
- scientific article; zbMATH DE number 1003305 (Why is no real title available?)
- scientific article; zbMATH DE number 432822 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- scientific article; zbMATH DE number 934444 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- Sublinear approximate string matching and biological applications
- Two-dimensional pattern matching by sampling
Cited in
(3)
This page was built for publication: Analysis of two-dimensional approximate pattern matching algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1129016)