Pages that link to "Item:Q2643726"
From MaRDI portal
The following pages link to On the complexity of the spaced seeds (Q2643726):
Displaying 10 items.
- Design and analysis of periodic multiple seeds (Q393900) (← links)
- Better spaced seeds using quadratic residues (Q394336) (← links)
- Hardness of optimal spaced seed design (Q931726) (← links)
- Seed optimization for i.i.d. similarities is no easier than optimal Golomb ruler design (Q990937) (← links)
- Metagenomic reads binning with spaced seeds (Q1676311) (← links)
- Sensitivity analysis and efficient method for identifying optimal spaced seeds (Q1878677) (← links)
- Analytic combinatorics for computing seeding probabilities (Q2633234) (← links)
- A Linear-Time Algorithm for Seeds Computation (Q4987445) (← links)
- Fast Spaced Seed Hashing (Q5111797) (← links)
- Combinatorial Pattern Matching (Q5315355) (← links)