Optimal spaced seeds for faster approximate string matching
From MaRDI portal
Recommendations
Cited in
(8)- On spaced seeds for similarity search
- Optimal spaced seeds for faster approximate string matching
- Approximate string matching using a bidirectional index
- Efficient Algorithms for Shortest Partial Seeds in Words
- Multi-seed lossless filtration (extended abstract)
- Hardness of optimal spaced seed design
- Graph connectivity, partial words, and a theorem of Fine and Wilf
- Hardness of optimal spaced seed 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 Q5716750)