Optimal spaced seeds for faster approximate string matching
From MaRDI portal
Publication:2643727
Recommendations
- Optimal spaced seeds for faster approximate string matching
- Fast and practical approximate string matching
- Faster approximate string matching
- A randomized algorithm for approximate string matching
- scientific article; zbMATH DE number 3845091
- scientific article; zbMATH DE number 975393
- Average-optimal single and multiple approximate string matching
- Average-optimal multiple approximate string matching
- Faster bit-parallel approximate string matching
Cites work
- Approximate String Matching: A Simpler Faster Algorithm
- Fast parallel and serial approximate string matching
- Faster algorithms for string matching with k mismatches
- scientific article; zbMATH DE number 1998337 (Why is no real title available?)
- On spaced seeds for similarity search
- Optimizing multiple spaced seeds for homology search
- Vector seeds: An extension to spaced seeds
Cited in
(14)- Lossless filter for multiple repetitions with Hamming distance
- On spaced seeds for similarity search
- Design and analysis of periodic multiple seeds
- Better spaced seeds using quadratic residues
- Fast spaced seed hashing
- Efficient Algorithms for Shortest Partial Seeds in Words
- Faster filters for approximate string matching
- Multi-seed lossless filtration (extended abstract)
- Hardness of optimal spaced seed design
- Optimal spaced seeds for faster approximate string matching
- Design of worst-case-optimal spaced seeds
- Hardness of optimal spaced seed design
- Combinatorics on partial word correlations
- Seed optimization for i.i.d. similarities is no easier than optimal Golomb ruler design
This page was built for publication: Optimal spaced seeds for faster approximate string matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643727)