A Subquadratic Algorithm for Approximate Regular Expression Matching
From MaRDI portal
Recommendations
- Approximate matching of regular expressions
- Approximating Approximate Pattern Matching
- A fast bit-parallel algorithm for matching extended regular expressions
- A faster algorithm for finding shortest substring matches of a regular expression
- Approximate regular expression pattern matching with concave gap penalties
- Efficient Submatch Extraction for Practical Regular Expressions
- Approximate regular expressions and their derivatives
- scientific article; zbMATH DE number 1962812
Cited in
(16)- Approximate matching of regular expressions
- A faster algorithm for finding shortest substring matches of a regular expression
- A subquadratic algorithm for approximate limited expression matching
- A taxonomy of sublinear multiple keyword pattern matching algorithms
- Fast and compact regular expression matching
- EFFICIENT AUTOMATA CONSTRUCTIONS AND APPROXIMATE AUTOMATA
- New Algorithms for Regular Expression Matching
- Fast Searching in Packed Strings
- A Four Russians algorithm for regular expression pattern matching
- scientific article; zbMATH DE number 2149350 (Why is no real title available?)
- Efficient Submatch Extraction for Practical Regular Expressions
- A succinct four Russians speedup for edit distance computation and one-against-many banded alignment
- Algorithms and Computation
- Fast searching in packed strings
- A unified view to string matching algorithms
- Matching regular expressions on uncertain data
This page was built for publication: A Subquadratic Algorithm for Approximate Regular Expression Matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4857536)
