Improving an algorithm for approximate pattern matching

DOI10.1007/S00453-001-0034-6MaRDI QIDQ5940613zbMATH OpenOpenAlexFDO

Authors Gonzalo Navarro, Ricardo Baeza-Yates

Publication date 9 August 2001

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-001-0034-6

zbMATH Keywords

approximate string matching

Mathematics Subject Classification ID

Algorithms in computer science (68W99)

Recommendations

• Faster approximate string matching
• A fast bit-vector algorithm for approximate string matching based on dynamic programming
• Multiple approximate string matching
• Fast and practical approximate string matching
• Very fast and simple approximate string matching

Cited in

(10)

• Faster approximate string matching
• Improved approximate pattern matching on hypertext
• Approximate string matching with compressed indexes
• Bit-parallel (\(\delta ,\gamma\))-matching and suffix automata
• Bit-parallel approximate string matching algorithms with transposition
• Very fast and simple approximate string matching
• A new filtration method and a hybrid strategy for approximate string matching
• scientific article; zbMATH DE number 1094183 (Why is no real title available?)
• New and faster filters for multiple approximate string matching
• A practical semi-external memory method for approximate pattern matching

This page was built for publication: Improving an algorithm for approximate pattern matching

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