A Linear Size Index for Approximate Pattern Matching
From MaRDI portal
Publication:5307492
DOI10.1007/11780441_6zbMath1196.68345OpenAlexW1767863216MaRDI QIDQ5307492
Wing-Kin Sung, Ho-Leung Chan, Swee-Seong Wong, Siu-Lung Tam, Tak-Wah Lam
Publication date: 14 September 2007
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11780441_6
Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Algorithms on strings (68W32)
Related Items (6)
Pattern matching with don't cares and few errors ⋮ Approximate string matching with compressed indexes ⋮ A filtering algorithm for \(k\)-mismatch with don't cares ⋮ Fast index for approximate string matching ⋮ Unnamed Item ⋮ Compressed indexes for approximate string matching
This page was built for publication: A Linear Size Index for Approximate Pattern Matching