Add to ORKGpublished in Efficient representation and parallel computation of string-substring longest common subsequence
The longest common subsequence (LCS) problem is a classical method of string comparison. Several coa...
Given two strings of lengths m and n≥m on an alphabet of size s, the longest common subsequence (LCS...
AbstractGiven two strings A and B of lengths na and nb, na⩽nb, respectively, the all-substrings long...
This note provides very simple, efficient algorithms for computing the number of distinct longest co...
This paper presents performance results for parallel algorithms that compute the longest common subs...
Abstract. This paper presents performance results for parallel algorithms that compute the longest c...
Given two strings X and Y of lengths m and n, re-spectively, the all-substrings longest common subse...
In this paper, a fast algorithm for the longest-common-subsequence problem is presented which runs i...
Abstract. A longest common subsequence (LCS) of two strings is a common subsequence of two strings o...
Given two strings A and B of lengths n(a) and n(b), n(a) <= n(b), respectively, the all-substrings l...
Data compression can be used to simultaneously reduce memory, communication and computation requirem...
This paper outlines the design of a bit-parallel, multi-string algorithm for high-similarity string ...
Although the Longest Common Subsequence (LCS)Problem has been studied by many researchers for years,...
International audienceThe paper presents a coarse-grained multicomputer algorithm that solves the Lo...
An efficient algorithm is presented that solves a Longest Restricted Common Subsequence Problem (RLC...
The longest common subsequence (LCS) problem is a classical method of string comparison. Several coa...
Given two strings of lengths m and n≥m on an alphabet of size s, the longest common subsequence (LCS...
AbstractGiven two strings A and B of lengths na and nb, na⩽nb, respectively, the all-substrings long...
This note provides very simple, efficient algorithms for computing the number of distinct longest co...
This paper presents performance results for parallel algorithms that compute the longest common subs...
Abstract. This paper presents performance results for parallel algorithms that compute the longest c...
Given two strings X and Y of lengths m and n, re-spectively, the all-substrings longest common subse...
In this paper, a fast algorithm for the longest-common-subsequence problem is presented which runs i...
Abstract. A longest common subsequence (LCS) of two strings is a common subsequence of two strings o...
Given two strings A and B of lengths n(a) and n(b), n(a) <= n(b), respectively, the all-substrings l...
Data compression can be used to simultaneously reduce memory, communication and computation requirem...
This paper outlines the design of a bit-parallel, multi-string algorithm for high-similarity string ...
Although the Longest Common Subsequence (LCS)Problem has been studied by many researchers for years,...
International audienceThe paper presents a coarse-grained multicomputer algorithm that solves the Lo...
An efficient algorithm is presented that solves a Longest Restricted Common Subsequence Problem (RLC...
The longest common subsequence (LCS) problem is a classical method of string comparison. Several coa...
Given two strings of lengths m and n≥m on an alphabet of size s, the longest common subsequence (LCS...
AbstractGiven two strings A and B of lengths na and nb, na⩽nb, respectively, the all-substrings long...