Multiple filtration and approximate pattern matching
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3126031 (Why is no real title available?)
- scientific article; zbMATH DE number 140453 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- A fast string searching algorithm
- A measure of the similarity of sets of sequences not requiring sequence alignment.
- A new distance metric on strings computable in linear time
- A sublinear algorithm for approximate keyword searching
- An Improved Algorithm For Approximate String Matching
- An algorithm for approximate membership checking with application to password security
- An approximate string-matching algorithm
- Approximate string-matching with q-grams and maximal matches
- Data structures and algorithms for approximate string matching
- Deterministic Sampling–A New Technique for Fast Pattern Matching
- Efficient randomized pattern-matching algorithms
- Efficient string matching with k mismatches
- Fast Pattern Matching in Strings
- Fast and practical approximate string matching
- Fast parallel and serial approximate string matching
- Finding approximate patterns in strings
- Parallel string matching with k mismatches
- RECOGNITION OF AN APPROXIMATE OCCURRENCE OF WORDS ON A TURING MACHINE IN REAL TIME
- Simple and efficient string matching with k mismatches
- Time-space-optimal string matching
Cited in
(13)- Sensitivity analysis and efficient method for identifying optimal spaced seeds
- Multiple matching of parameterized patterns
- Seed optimization for i.i.d. similarities is no easier than optimal Golomb ruler design
- A taxonomy of sublinear multiple keyword pattern matching algorithms
- Approximate search of short patterns with high error rates using the \(01^\ast 0\) lossless seeds
- Multiple Matching and Runs by the Symbolic Method
- DNA-seq error correction based on substring indices
- On-Line Approximate String Searching Algorithms: Survey and Experimental Results
- A simple, fast, filter-based algorithm for circular sequence comparison
- Faster filters for approximate string matching
- scientific article; zbMATH DE number 1786459 (Why is no real title available?)
- Lossless filter for multiple repetitions with Hamming distance
- INDEXING GAPPED-FACTORS USING A TREE
This page was built for publication: Multiple filtration and approximate pattern matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1902470)
