\(k\)-difference matching in amortized linear time for all the words in a text

DOI10.1016/J.TCS.2008.12.018zbMath1162.68040OpenAlexW2079718285MaRDI QIDQ1006084

Cinzia Pizzi

Publication date: 17 March 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.12.018

zbMATH Keywords

string-matching problemwords with mismatches

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Related Items (2)

Sequence similarity measures based on bounded Hamming distance ⋮ A new distributed alignment-free approach to compare whole proteomes

Cites Work

• Motif discovery by monotone scores
• Efficient string matching with k mismatches
• Dictionary matching and indexing with errors and don't cares
• Generalized String Matching
• Algorithms on Strings, Trees and Sequences
• Faster algorithms for string matching with k mismatches
• Combinatorial Pattern Matching

This page was built for publication: \(k\)-difference matching in amortized linear time for all the words in a text