Pages that link to "Item:Q5307517"

The following pages link to Faster Algorithms for Computing Longest Common Increasing Subsequences (Q5307517):

Displaying 15 items.

• Computing a longest common subsequence that is almost increasing on sequences having no repeated elements (Q396635) (← links)
• Faster algorithms for computing longest common increasing subsequences (Q655431) (← links)
• A new efficient algorithm for computing the longest common subsequence (Q733720) (← links)
• A fast algorithm for computing a longest common increasing subsequence (Q835045) (← links)
• A linear space algorithm for computing a longest common increasing subsequence (Q845723) (← links)
• New efficient algorithms for the LCS and constrained LCS problems (Q963324) (← links)
• Efficient algorithms for finding a longest common increasing subsequence (Q996830) (← links)
• A linear algorithm for 3-letter longest common weakly increasing subsequence (Q1943622) (← links)
• FACC: a novel finite automaton based on cloud computing for the multiple longest common subsequences search (Q1954643) (← links)
• Fast computation of a longest increasing subsequence and application (Q1959440) (← links)
• Computing a longest common almost-increasing subsequence of two sequences (Q2220858) (← links)
• Tight conditional lower bounds for longest common increasing subsequence (Q2272597) (← links)
• A diagonal-based algorithm for the longest common increasing subsequence problem (Q2310745) (← links)
• (Q4739189) (← links)
• Near-optimal algorithm to count occurrences of subsequences of a given length (Q5367537) (← links)