Pages that link to "Item:Q765507"
From MaRDI portal
The following pages link to The longest almost-increasing subsequence (Q765507):
Displaying 5 items.
- Computing a longest common subsequence that is almost increasing on sequences having no repeated elements (Q396635) (← links)
- Improvised divide and conquer approach for the LIS problem (Q1748198) (← links)
- Computing longest (common) Lyndon subsequences (Q2169947) (← links)
- Computing a longest common almost-increasing subsequence of two sequences (Q2220858) (← links)
- Computing longest Lyndon subsequences and longest common Lyndon subsequences (Q6119829) (← links)
