On spaced seeds for similarity search
From MaRDI portal
Publication:1827801
DOI10.1016/S0166-218X(03)00382-2zbMath1043.92009OpenAlexW2109692166MaRDI QIDQ1827801
Uri Keich, Bin Ma, Ming Li, John Tromp
Publication date: 6 August 2004
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(03)00382-2
Related Items (19)
Sensitivity analysis and efficient method for identifying optimal spaced seeds ⋮ Approximate search of short patterns with high error rates using the \(01^\ast 0\) lossless seeds ⋮ On the complexity of the spaced seeds ⋮ Optimal spaced seeds for faster approximate string matching ⋮ Faster exact distributions of pattern statistics through sequential elimination of states ⋮ Minimal auxiliary Markov chains through sequential elimination of states ⋮ Design and analysis of periodic multiple seeds ⋮ Better spaced seeds using quadratic residues ⋮ Subset Seed Automaton ⋮ Graph connectivity, partial words, and a theorem of Fine and Wilf ⋮ Designing Efficient Spaced Seeds for SOLiD Read Mapping ⋮ BDD-BASED ANALYSIS OF GAPPED q-GRAM FILTERS ⋮ Vector seeds: An extension to spaced seeds ⋮ Combinatorics on partial word correlations ⋮ FINE AND WILF'S THEOREM FOR PARTIAL WORDS WITH ARBITRARILY MANY WEAK PERIODS ⋮ Seed optimization for i.i.d. similarities is no easier than optimal Golomb ruler design ⋮ Masking patterns in sequences: A new class of motif discovery with don't cares ⋮ Distributions of pattern statistics in sparse Markov models ⋮ Fast Spaced Seed Hashing
Uses Software
Cites Work
This page was built for publication: On spaced seeds for similarity search
