Abstract: There are many algorithms for computing the longest common subsequence, which are especially used in comparing files, text, comparison of DNA and protein sequences. In this paper we had done ...

Abstract: This article considers the longest common square subsequence (LCSqS) problem, a variant of the longest common subsequence (LCS) problem in which solutions must be square strings. A square ...

Edit distance—a classical problem in computer science—has received ongoing attention from both practitioners and theoreticians. Given two strings A and B, the edit distance is the minimum number of ...

Patch version resolving huge memory consumption when building the index. Index construction now consumes similar amount of memory as the final constructed index. Index files (stored to disk) ...