Pages that link to "Item:Q2445236"
From MaRDI portal
The following pages link to A dynamic programming solution to a generalized LCS problem (Q2445236):
Displaying 9 items.
- Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion (Q489728) (← links)
- A linear space algorithm for the LCS problem (Q1101217) (← links)
- A simple algorithm for solving for the generalized longest common subsequence (LCS) problem with a substring exclusion constraint (Q1736579) (← links)
- A space efficient algorithm for the longest common subsequence in \(k\)-length substrings (Q2357383) (← links)
- Generalized LCS (Q2378524) (← links)
- Solving RCPSP/max by lazy clause generation (Q2434317) (← 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)
- (Q4939025) (← links)