Sensitivity analysis and efficient method for identifying optimal spaced seeds

DOI10.1016/j.jcss.2003.04.002zbMath1072.68093OpenAlexW2024811036MaRDI QIDQ1878677

Louxin Zhang, Kwok Pui Choi

Publication date: 8 September 2004

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2003.04.002

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Related Items (4)

On the complexity of the spaced seeds ⋮ Hardness of optimal spaced seed design ⋮ BDD-BASED ANALYSIS OF GAPPED q-GRAM FILTERS ⋮ Seed optimization for i.i.d. similarities is no easier than optimal Golomb ruler design

Uses Software

• PatternHunter

Cites Work

• Unnamed Item
• Unnamed Item
• A time-efficient, linar-space local similarity algorithm
• On spaced seeds for similarity search
• Multiple filtration and approximate pattern matching
• A measure of the similarity of sets of sequences not requiring sequence alignment.
• Efficient randomized pattern-matching algorithms
• Distribution Theory of Runs: A Markov Chain Approach
• Run Probabilities in Sequences of Markov-Dependent Trials
• A Combinatorial Identity and Its Application to the Problem Concerning the First Occurrence of a Rare Event

This page was built for publication: Sensitivity analysis and efficient method for identifying optimal spaced seeds