A subquadratic algorithm for approximate limited expression matching
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3633757 (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 string searching algorithm
- A faster algorithm computing string edit distances
- A sublinear algorithm for approximate keyword searching
- An Improved Algorithm For Approximate String Matching
- Approximate Boyer–Moore String Matching
- Approximate string matching with suffix automata
- Approximate string-matching with q-grams and maximal matches
- Efficient string matching
- Fast Pattern Matching in Strings
- Fast string matching with k differences
- Finding approximate patterns in strings
- Generalized String Matching
- The String-to-String Correction Problem
- The theory and computation of evolutionary distances: Pattern recognition
Cited in
(12)- Multiple approximate string matching
- A sublinear algorithm for approximate keyword searching
- Matching regular expressions on uncertain data
- Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching
- Improved approximate pattern matching on hypertext
- Fast distance multiplication of unit-Monge matrices
- A fast and practical bit-vector algorithm for the longest common subsequence problem
- On-Line Approximate String Searching Algorithms: Survey and Experimental Results
- Approximate Boyer-Moore string matching for small alphabets
- Fast and practical approximate string matching
- New and faster filters for multiple approximate string matching
- BIT-PARALLEL COMPUTATION OF LOCAL SIMILARITY SCORE MATRICES WITH UNITARY WEIGHTS
This page was built for publication: A subquadratic algorithm for approximate limited expression matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1907030)
