Pages that link to "Item:Q1190449"

The following pages link to Fast linear-space computations of longest common subsequences (Q1190449):

Displaying 24 items.

• A versatile divide and conquer technique for optimal string alignment (Q294680) (← links)
• New tabulation and sparse dynamic programming based techniques for sequence similarity problems (Q313774) (← links)
• Variants of constrained longest common subsequence (Q407588) (← links)
• An almost-linear time and linear space algorithm for the longest common subsequence problem (Q1041737) (← links)
• New algorithms for the LCS problem (Q1072704) (← links)
• The longest common subsequence problem revisited (Q1098310) (← links)
• Fast linear-space computations of longest common subsequences (Q1190449) (← links)
• Simple and fast linear space computation of longest common subsequences (Q1583368) (← links)
• A fast and practical bit-vector algorithm for the longest common subsequence problem (Q1607132) (← links)
• Efficient merged longest common subsequence algorithms for similar sequences (Q1686075) (← links)
• A space efficient algorithm for the longest common subsequence in \(k\)-length substrings (Q2357383) (← links)
• Finding least-weight subsequences with fewer processors (Q2366242) (← links)
• Longest common subsequence in sublinear space (Q2656347) (← links)
• (Q3143773) (← links)
• APPLICATION-SPECIFIC ARRAY PROCESSORS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM OF THREE SEQUENCES ∗ † (Q4240887) (← links)
• DERIVING A FAST SYSTOLIC ALGORITHM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM (Q4532713) (← links)
• Sparse Dynamic Programming for Longest Common Subsequence from Fragments (Q4538080) (← links)
• Longest common subsequences (Q5096874) (← links)
• Maximal Common Subsequence Algorithms (Q5140762) (← links)
• String Processing and Information Retrieval (Q5393947) (← links)
• Practical Performance of Space Efficient Data Structures for Longest Common Extensions. (Q5874509) (← links)
• Linear-space S-table algorithms for the longest common subsequence problem (Q6104353) (← links)
• The colored longest common prefix array computed via sequential scans (Q6109741) (← links)
• A Scalable Approximation Algorithm for Weighted Longest Common Subsequence (Q6487194) (← links)