Pages that link to "Item:Q3506958"
From MaRDI portal
The following pages link to Constrained LCS: Hardness and Approximation (Q3506958):
Displaying 9 items.
- Variants of constrained longest common subsequence (Q407588) (← links)
- Approximability of constrained LCS (Q439929) (← links)
- Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion (Q489728) (← links)
- On the generalized constrained longest common subsequence problems (Q491203) (← links)
- Constrained sequence analysis algorithms in computational biology (Q527151) (← links)
- Comparing incomplete sequences via longest common subsequence (Q2333802) (← links)
- Anytime algorithms for the longest common palindromic subsequence problem (Q2337390) (← links)
- An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints (Q2447542) (← links)
- (Q5111874) (← links)
