A unified view to string matching algorithms
type: Item
instance of: scholarly article
title: A unified view to string matching algorithms
zbMATH Open document ID: 1541.68456
author: Ricardo Baeza-Yates
publication date: 2024-06-21T00:00:00Z
Mathematics Subject Classification ID: 68W32
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 7869543
MaRDI profile type: Publication
cites work: Generalized String Matching
cites work: Q4234091
cites work: Searching subsequences
cites work: On Boyer-Moore automata
cites work: A fast string searching algorithm
cites work: A fast algorithm for string matching with mismatches
cites work: Q4055156
cites work: Surpassing the information theoretic bound with fusion trees
cites work: An Improved Algorithm For Approximate String Matching
cites work: Fast algorithms for approximately counting mismatches
cites work: Fast Pattern Matching in Strings
cites work: Fast string matching with k differences
cites work: An algorithm for string matching with a sequence of don't cares
cites work: Approximate matching of regular expressions
cites work: A Four Russians algorithm for regular expression pattern matching
cites work: A sublinear algorithm for approximate keyword searching
cites work: Q3719846
cites work: Programming Techniques: Regular expression search algorithm
cites work: Algorithms for approximate string matching
cites work: Finding approximate patterns in strings
cites work: A Subquadratic Algorithm for Approximate Regular Expression Matching
cites work: Approximate string matching using withinword parallelism
DOI: 10.1007/BFB0037393
description: scientific article; zbMATH DE number 7869543