A unified view to string matching algorithms

DOI10.1007/BFB0037393zbMATH Open1541.68456MaRDI QIDQ6560185FDOQ6560185

Authors: Ricardo Baeza-Yates 

Publication date: 21 June 2024

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

Mathematics Subject Classification ID

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

Cites Work

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

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)