On the complexity of the spaced seeds
From MaRDI portal
Publication:2643726
Recommendations
Cites work
- Combinatorial Pattern Matching
- Combinatorial Pattern Matching
- Extensions of Jentzsch's Theorem
- scientific article; zbMATH DE number 193132 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1405792 (Why is no real title available?)
- On spaced seeds for similarity search
- On the closest string and substring problems
- Sensitivity analysis and efficient method for identifying optimal spaced seeds
- Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis
Cited in
(11)- Metagenomic reads binning with spaced seeds
- Sensitivity analysis and efficient method for identifying optimal spaced seeds
- Analytic combinatorics for computing seeding probabilities
- Optimal spaced seeds for hidden Markov models, with application to homologous coding regions
- New Algorithms for the Spaced Seeds
- Design and analysis of periodic multiple seeds
- Better spaced seeds using quadratic residues
- Fast spaced seed hashing
- Combinatorial Pattern Matching
- Hardness of optimal spaced seed design
- Seed optimization for i.i.d. similarities is no easier than optimal Golomb ruler design
This page was built for publication: On the complexity of the spaced seeds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643726)