Pages that link to "Item:Q2252645"
From MaRDI portal
The following pages link to Efficient algorithms for the longest common subsequence in \(k\)-length substrings (Q2252645):
Displaying 14 items.
- LCS\(k\): a refined similarity measure (Q294924) (← links)
- New tabulation and sparse dynamic programming based techniques for sequence similarity problems (Q313774) (← links)
- A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings (Q975491) (← links)
- Efficient merged longest common subsequence algorithms for similar sequences (Q1686075) (← links)
- Efficient algorithms for the longest common subsequence problem with sequential substring constraints (Q1931428) (← links)
- A note on the longest common substring with \(k\)-mismatches problem (Q2345875) (← links)
- Resequencing a set of strings based on a target string (Q2354022) (← links)
- A space efficient algorithm for the longest common subsequence in \(k\)-length substrings (Q2357383) (← links)
- An all-substrings common subsequence algorithm (Q2482100) (← links)
- The longest common substring problem (Q2971067) (← links)
- Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings (Q2971148) (← links)
- String Processing and Information Retrieval (Q5393943) (← links)
- Efficient List-Based Computation of the String Subsequence Kernel (Q5404907) (← links)
- A Scalable Approximation Algorithm for Weighted Longest Common Subsequence (Q6487194) (← links)
