Pages that link to "Item:Q1029006"
From MaRDI portal
The following pages link to The constrained longest common subsequence problem (Q1029006):
Displaying 18 items.
- LCS\(k\): a refined similarity measure (Q294924) (← links)
- A multiobjective optimization algorithm for the weighted LCS (Q313763) (← links)
- The constrained shortest common supersequence problem (Q396654) (← links)
- Variants of constrained longest common subsequence (Q407588) (← links)
- Fast algorithms for computing the constrained LCS of run-length encoded strings (Q428842) (← links)
- Quadratic-time algorithm for a string constrained LCS problem (Q436553) (← links)
- Doubly-constrained LCS and hybrid-constrained LCS problems revisited (Q436604) (← 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)
- A new efficient algorithm for computing the longest common subsequence (Q733720) (← links)
- Regular expression constrained sequence alignment (Q925058) (← links)
- Algorithms for computing variants of the longest common subsequence problem (Q932321) (← links)
- New efficient algorithms for the LCS and constrained LCS problems (Q963324) (← links)
- Finite automata based algorithms on subsequences and supersequences of degenerate strings (Q972350) (← links)
- A simple algorithm for solving for the generalized longest common subsequence (LCS) problem with a substring exclusion constraint (Q1736579) (← links)
- Improvised divide and conquer approach for the LIS problem (Q1748198) (← links)
