Pages that link to "Item:Q1827801"
From MaRDI portal
The following pages link to On spaced seeds for similarity search (Q1827801):
Displaying 19 items.
- Design and analysis of periodic multiple seeds (Q393900) (← links)
- Better spaced seeds using quadratic residues (Q394336) (← links)
- Masking patterns in sequences: A new class of motif discovery with don't cares (Q732023) (← links)
- Distributions of pattern statistics in sparse Markov models (Q778872) (← links)
- Graph connectivity, partial words, and a theorem of Fine and Wilf (Q924728) (← links)
- Combinatorics on partial word correlations (Q986100) (← links)
- Seed optimization for i.i.d. similarities is no easier than optimal Golomb ruler design (Q990937) (← links)
- Vector seeds: An extension to spaced seeds (Q1775772) (← links)
- Sensitivity analysis and efficient method for identifying optimal spaced seeds (Q1878677) (← links)
- Faster exact distributions of pattern statistics through sequential elimination of states (Q2397054) (← links)
- Approximate search of short patterns with high error rates using the \(01^\ast 0\) lossless seeds (Q2628801) (← links)
- On the complexity of the spaced seeds (Q2643726) (← links)
- Optimal spaced seeds for faster approximate string matching (Q2643727) (← links)
- Designing Efficient Spaced Seeds for SOLiD Read Mapping (Q3002743) (← links)
- FINE AND WILF'S THEOREM FOR PARTIAL WORDS WITH ARBITRARILY MANY WEAK PERIODS (Q3056274) (← links)
- Subset Seed Automaton (Q3503905) (← links)
- Minimal auxiliary Markov chains through sequential elimination of states (Q5085915) (← links)
- Fast Spaced Seed Hashing (Q5111797) (← links)
- BDD-BASED ANALYSIS OF GAPPED q-GRAM FILTERS (Q5714661) (← links)
