Pages that link to "Item:Q1241422"
From MaRDI portal
The following pages link to An information-theoretic lower bound for the longest common subsequence problem (Q1241422):
Displaying 11 items.
- New tabulation and sparse dynamic programming based techniques for sequence similarity problems (Q313774) (← links)
- A systolic array for the longest common subsequence problem (Q1066678) (← links)
- New algorithms for the LCS problem (Q1072704) (← links)
- An \(O(ND)\) difference algorithm and its variations (Q1099955) (← links)
- A lower bound for the edit-distance problem under an arbitrary cost function (Q1107330) (← links)
- Matching for run-length encoded strings (Q1288529) (← links)
- Performance analysis of some simple heuristics for computing longest common subsequences (Q1336959) (← links)
- A fast and practical bit-vector algorithm for the longest common subsequence problem (Q1607132) (← links)
- Searching subsequences (Q2638800) (← links)
- APPLICATION-SPECIFIC ARRAY PROCESSORS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM OF THREE SEQUENCES ∗ † (Q4240887) (← links)
- Longest common subsequences (Q5096874) (← links)