Faster filters for approximate string matching

DOI10.1137/1.9781611972870.8MaRDI QIDQ5233494zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• New and faster filters for multiple approximate string matching
• Multiple filtration and approximate pattern matching
• Very fast and simple approximate string matching
• On using q-gram locations in approximate string matching
• Optimal spaced seeds for faster approximate string matching

Cited in

(8)

• Verifiable pattern matching on outsourced texts
• Approximate search of short patterns with high error rates using the 01^ 0 lossless seeds
• Approximate string matching using a bidirectional index
• Efficient log filter
• A new filtration method and a hybrid strategy for approximate string matching
• Approximate all-pairs suffix/prefix overlaps
• New and faster filters for multiple approximate string matching
• Faster Online Elastic Degenerate String Matching

This page was built for publication: Faster filters for approximate string matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5233494)