Pages that link to "Item:Q765507"
From MaRDI portal
The following pages link to The longest almost-increasing subsequence (Q765507):
Displaying 14 items.
- Computing a longest common subsequence that is almost increasing on sequences having no repeated elements (Q396635) (← links)
- Longest increasing subsequences and log concavity (Q1682614) (← 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)
- Book review of: D. Romik, The surprising mathematics of longest increasing subsequences (Q2362783) (← links)
- On the longest increasing subsequence for finite and countable alphabets (Q2900956) (← links)
- The Longest Almost-Increasing Subsequence (Q3578333) (← links)
- Small Longest Tandem Scattered Subsequences (Q5089621) (← links)
- On longest matching consecutive subsequence (Q5232179) (← links)
- Longest Increasing Subsequences of Randomly Chosen Multi-Row Arrays (Q5364222) (← links)
- (Q5421713) (← links)
- Computing longest Lyndon subsequences and longest common Lyndon subsequences (Q6119829) (← links)
- The longest almost increasing subsequence problem with sliding windows (Q6562878) (← links)