Pages that link to "Item:Q1736579"
From MaRDI portal
The following pages link to A simple algorithm for solving for the generalized longest common subsequence (LCS) problem with a substring exclusion constraint (Q1736579):
Displaying 5 items.
- Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion (Q489728) (← 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)
- An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints (Q2447542) (← links)
- Computing longest common square subsequences (Q5140779) (← links)
