A unified view to string matching algorithms

DOI10.1007/BFB0037393MaRDI QIDQ6560185zbMATHFDO

Authors Ricardo Baeza-Yates

Publication date 21 June 2024

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algorithms on strings (68W32)

Recommendations

• Faster approximate string matching
• Fast and flexible string matching by combining bit-parallelism and suffix automata
• Multiple approximate string matching
• Generalized String Matching
• A fast bit-vector algorithm for approximate string matching based on dynamic programming

Cites work

• scientific article; zbMATH DE number 3949728 (Why is no real title available?)
• scientific article; zbMATH DE number 3471577 (Why is no real title available?)
• scientific article; zbMATH DE number 1263219 (Why is no real title available?)
• A Four Russians algorithm for regular expression pattern matching
• A Subquadratic Algorithm for Approximate Regular Expression Matching
• A fast algorithm for string matching with mismatches
• A fast string searching algorithm
• A sublinear algorithm for approximate keyword searching
• Algorithms for approximate string matching
• An Improved Algorithm For Approximate String Matching
• An algorithm for string matching with a sequence of don't cares
• Approximate matching of regular expressions
• Approximate string matching using withinword parallelism
• Fast Pattern Matching in Strings
• Fast algorithms for approximately counting mismatches
• Fast string matching with k differences
• Finding approximate patterns in strings
• Generalized String Matching
• On Boyer-Moore automata
• Programming Techniques: Regular expression search algorithm
• Searching subsequences
• Surpassing the information theoretic bound with fusion trees

This page was built for publication: A unified view to string matching algorithms

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