Longest Common Subsequence in k-length substrings

  title={Longest Common Subsequence in k-length substrings},
  author={Gary Benson and Avivit Levy and B. Riva Shalom},
In this paper we define a new problem, motivated by computational biology, LCSk aiming at finding the maximal number of k length substrings, matching in both input strings while preserving their order of appearance. The traditional LCS definition is a special case of our problem, where k = 1. We provide an algorithm, solving the general case in O(n) time, where n is the length of the input strings, equaling the time required for the special case of k = 1. The space requirement of the algorithm… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS
Related Discussions
This paper has been referenced on Twitter 1 time. VIEW TWEETS

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.
Showing 1-10 of 12 extracted citations

Comparative analysis of alignment tools for nanopore reads

2017 IEEE International Conference on Bioinformatics and Biomedicine (BIBM) • 2017
View 1 Excerpt

Similar Papers

Loading similar papers…