Seed optimization for i.i.d. similarities is no easier than optimal Golomb ruler design

DOI10.1016/j.ipl.2009.07.008zbMath1206.68148OpenAlexW1981666173MaRDI QIDQ990937

Bin Ma, Hongyi Yao

Publication date: 1 September 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.07.008

zbMATH Keywords

computational complexityspaced seedsGolomb ruler

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

Better spaced seeds using quadratic residues

Uses Software

• PatternHunter

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis
• On spaced seeds for similarity search
• Sensitivity analysis and efficient method for identifying optimal spaced seeds
• Multiple filtration and approximate pattern matching
• On the complexity of the spaced seeds
• Optimal spaced seeds for faster approximate string matching
• Superiority and complexity of the spaced seeds
• A new algorithm for Golomb ruler derivation and proof of the 19 mark ruler
• Combinatorial Pattern Matching
• A class of binary recurrent codes with limited error propagation
• Combinatorial Pattern Matching

This page was built for publication: Seed optimization for i.i.d. similarities is no easier than optimal Golomb ruler design