Faster Filters for Approximate String Matching

DOI10.1137/1.9781611972870.8zbMath1428.68400OpenAlexW112766053MaRDI QIDQ5233494

Juha Kärkkäinen, Joong Chae Na

Publication date: 11 September 2019

Published in: 2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/2f580ebbe6f1cd56205d64ec3b1e8d3d5af67134

Mathematics Subject Classification ID

Data structures (68P05) Algorithms on strings (68W32)

Related Items

Approximate string matching using a bidirectional index, Approximate search of short patterns with high error rates using the \(01^\ast 0\) lossless seeds, Approximate all-pairs suffix/prefix overlaps, Verifiable pattern matching on outsourced texts