Pages that link to "Item:Q5900087"
From MaRDI portal
The following pages link to Repetition-free longest common subsequence (Q5900087):
Displaying 10 items.
- Repetition-free longest common subsequence of random sequences (Q299053) (← links)
- Variants of constrained longest common subsequence (Q407588) (← links)
- Exact algorithms for the repetition-bounded longest common subsequence problem (Q2197547) (← 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)
- A branch-and-cut approach to the repetition-free longest common subsequence problem (Q2883608) (← links)
- A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant (Q5458540) (← links)
- Repetition-free longest common subsequence (Q5901069) (← links)
- Cyclic longest common subsequence (Q6132857) (← links)
- Polynomial-time equivalences and refined algorithms for longest common subsequence variants (Q6546417) (← links)