Pages that link to "Item:Q5901069"
From MaRDI portal
The following pages link to Repetition-free longest common subsequence (Q5901069):
Displaying 16 items.
- Repetition-free longest common subsequence of random sequences (Q299053) (← links)
- The constrained shortest common supersequence problem (Q396654) (← links)
- On the parameterized complexity of the repetition free longest common subsequence problem (Q413298) (← links)
- Doubly-constrained LCS and hybrid-constrained LCS problems revisited (Q436604) (← links)
- Exact algorithms for the repetition-bounded longest common subsequence problem (Q2197547) (← links)
- An \(A^\ast\) search algorithm for the constrained longest common subsequence problem (Q2224853) (← links)
- Comparing incomplete sequences via longest common subsequence (Q2333802) (← links)
- Anytime algorithms for the longest common palindromic subsequence problem (Q2337390) (← links)
- A hybrid genetic algorithm for the repetition free longest common subsequence problem (Q2450749) (← links)
- Avoiding approximate repetitions with respect to the longest common subsequence distance (Q2631171) (← links)
- Solving longest common subsequence problems via a transformation to the maximum clique problem (Q2664444) (← links)
- A branch-and-cut approach to the repetition-free longest common subsequence problem (Q2883608) (← links)
- Repetition-free longest common subsequence (Q5900087) (← links)
- Cyclic longest common subsequence (Q6132857) (← links)
- Construct, Merge, Solve and Adapt: Application to the Repetition-Free Longest Common Subsequence Problem (Q6483593) (← links)
- Beam-ACO for the Repetition-Free Longest Common Subsequence Problem (Q6487177) (← links)
