Pages that link to "Item:Q2197547"
From MaRDI portal
The following pages link to Exact algorithms for the repetition-bounded longest common subsequence problem (Q2197547):
Displaying 6 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)
- Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence (Q2294598) (← links)
- String Processing and Information Retrieval (Q5393947) (← links)
- Repetition-free longest common subsequence (Q5900087) (← links)
- Polynomial-time equivalences and refined algorithms for longest common subsequence variants (Q6546417) (← links)