Pages that link to "Item:Q313774"
From MaRDI portal
The following pages link to New tabulation and sparse dynamic programming based techniques for sequence similarity problems (Q313774):
Displaying 8 items.
- Efficient merged longest common subsequence algorithms for similar sequences (Q1686075) (← links)
- An efficient algorithm for LCS problem between two arbitrary sequences (Q1720875) (← links)
- A hardness result and new algorithm for the longest common palindromic subsequence problem (Q2410574) (← links)
- Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier (Q5097510) (← links)
- (Q5140779) (← links)
- A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem (Q6065393) (← links)
- (Q6084394) (← links)
- Linear-space S-table algorithms for the longest common subsequence problem (Q6104353) (← links)
