Pages that link to "Item:Q489728"
From MaRDI portal
The following pages link to Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion (Q489728):
Displaying 5 items.
- A simple algorithm for solving for the generalized longest common subsequence (LCS) problem with a substring exclusion constraint (Q1736579) (← links)
- Tight conditional lower bounds for longest common increasing subsequence (Q2272597) (← links)
- An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints (Q2447542) (← links)
- (Q5111874) (← links)
- Linear-space S-table algorithms for the longest common subsequence problem (Q6104353) (← links)