Pages that link to "Item:Q436553"
From MaRDI portal
The following pages link to Quadratic-time algorithm for a string constrained LCS problem (Q436553):
Displaying 12 items.
- Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion (Q489728) (← links)
- A simple algorithm for solving for the generalized longest common subsequence (LCS) problem with a substring exclusion constraint (Q1736579) (← links)
- Maximal common subsequence algorithms (Q2326405) (← links)
- The substring inclusion constraint longest common subsequence problem can be solved in quadratic time (Q2376791) (← links)
- A hardness result and new algorithm for the longest common palindromic subsequence problem (Q2410574) (← links)
- A dynamic programming solution to a generalized LCS problem (Q2445236) (← links)
- An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints (Q2447542) (← links)
- Faster STR-EC-LCS Computation (Q3297762) (← links)
- Computing longest common square subsequences (Q5140779) (← links)
- Approximating LCS in Linear Time: Beating the √<i>n</i> Barrier (Q5236256) (← links)
- Faster space-efficient STR-IC-LCS computation (Q6549673) (← links)
- String editing under pattern constraints (Q6646447) (← links)
