Faster space-efficient STR-IC-LCS computation
From MaRDI portal
Publication:6549673
Recommendations
Cites work
- A faster algorithm computing string edit distances
- A linear space algorithm for computing maximal common subsequences
- A longest common subsequence algorithm suitable for similar text strings
- A simple algorithm for the constrained sequence problems
- Fast and compact regular expression matching
- Faster STR-EC-LCS computation
- Faster STR-IC-LCS computation via RLE
- On the generalized constrained longest common subsequence problems
- Quadratic-time algorithm for a string constrained LCS problem
- Space-efficient STR-IC-LCS computation
- The String-to-String Correction Problem
- The constrained longest common subsequence problem
- The fine-grained complexity of episode matching
This page was built for publication: Faster space-efficient STR-IC-LCS computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6549673)