Pages that link to "Item:Q5307517"
From MaRDI portal
The following pages link to Faster Algorithms for Computing Longest Common Increasing Subsequences (Q5307517):
Displayed 7 items.
- Computing a longest common subsequence that is almost increasing on sequences having no repeated elements (Q396635) (← links)
- A new efficient algorithm for computing the longest common subsequence (Q733720) (← links)
- New efficient algorithms for the LCS and constrained LCS problems (Q963324) (← links)
- Efficient algorithms for finding a longest common increasing subsequence (Q996830) (← links)
- FACC: a novel finite automaton based on cloud computing for the multiple longest common subsequences search (Q1954643) (← links)
- A diagonal-based algorithm for the longest common increasing subsequence problem (Q2310745) (← links)
- Near-optimal algorithm to count occurrences of subsequences of a given length (Q5367537) (← links)