The following pages link to (Q4918894):
Displaying 13 items.
- On the parameterized complexity of the repetition free longest common subsequence problem (Q413298) (← links)
- Parameterized complexity and approximability of the longest compatible sequence problem (Q456697) (← links)
- Dynamic programming algorithms for the mosaic longest common subsequence problem (Q845973) (← links)
- Thermodynamical approach to the longest common subsequence problem (Q937112) (← links)
- Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence (Q1029349) (← links)
- The shortest common nonsubsequence problem is NP-complete (Q1208726) (← links)
- The longest common subsequence problem for sequences with nested arc annotations. (Q1872715) (← links)
- Anytime algorithms for the longest common palindromic subsequence problem (Q2337390) (← links)
- (Q2723948) (← links)
- The Constrained Longest Common Subsequence Problem for Degenerate Strings (Q3503920) (← links)
- On the Longest Common Parameterized Subsequence (Q3506962) (← links)
- The longest filled common subsequence problem (Q5110878) (← links)
- Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs (Q5307512) (← links)
