Pages that link to "Item:Q2180128"
From MaRDI portal
The following pages link to Exact algorithms for the bounded repetition longest common subsequence problem (Q2180128):
Displaying 3 items.
- On the parameterized complexity of the repetition free longest common subsequence problem (Q413298) (← 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)