Pages that link to "Item:Q2378530"
From MaRDI portal
The following pages link to Fast and compact regular expression matching (Q2378530):
Displaying 18 items.
- New tabulation and sparse dynamic programming based techniques for sequence similarity problems (Q313774) (← links)
- Faster approximate string matching for short patterns (Q692899) (← links)
- Compact representations of automata for regular expression matching (Q738883) (← links)
- An efficient algorithm for LCS problem between two arbitrary sequences (Q1720875) (← links)
- From regular expression matching to parsing (Q2089747) (← links)
- A comparative study of dictionary matching with gaps: limitations, techniques and challenges (Q2118199) (← links)
- Fast distance multiplication of unit-Monge matrices (Q2350900) (← links)
- Subsequence automata with default transitions (Q2363354) (← links)
- Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition (Q3007644) (← links)
- Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity (Q4933374) (← links)
- (Q5002674) (← links)
- (Q5091741) (← links)
- From Regular Expression Matching to Parsing (Q5092434) (← links)
- Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier (Q5097510) (← links)
- (Q5140779) (← links)
- Space-Efficient Representations for Glushkov Automata (Q5384522) (← links)
- A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem (Q6065393) (← links)
- Faster space-efficient STR-IC-LCS computation (Q6549673) (← links)
