This paper outlines the design of a bit-parallel, multi-string algorithm for high-similarity string comparison. We present it in the framework for the longest common subsequence (LCS) problem developed by the author in [31]. The algorithm is based on a bit-parallel LCS algorithm by Crochemore et al. [14]
published in Efficient representation and parallel computation of string-substring longest common su...
This note provides very simple, efficient algorithms for computing the number of distinct longest co...
Although the Longest Common Subsequence (LCS)Problem has been studied by many researchers for years,...
The longest common subsequence (LCS) problem is a classical method of string comparison. Several coa...
In this paper. we show new parallel algorithms for a set of classical string comparison problems. co...
The longest common subsequence (LCS) is a classic and well-studied measure of similarity between tw...
AbstractThe LCS problem is to determine a longest common subsequence (LCS) of two symbol sequences. ...
The constrained longest common subsequence (CLCS) problem was introduced as a specific measure of si...
Abstract. We consider the classic problem of computing (the length of) the longest common subsequenc...
Data compression can be used to simultaneously reduce memory, communication and computation requirem...
AbstractSpace saving techniques in computations of a longest common subsequence (LCS) of two strings...
Given two strings X and Y of lengths m and n, re-spectively, the all-substrings longest common subse...
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem cons...
AbstractA classical measure of similarity between strings is the length of the longest common subseq...
For two strings a, b of lengths m, n, respectively, the longest common subsequence (LCS) problem con...
published in Efficient representation and parallel computation of string-substring longest common su...
This note provides very simple, efficient algorithms for computing the number of distinct longest co...
Although the Longest Common Subsequence (LCS)Problem has been studied by many researchers for years,...
The longest common subsequence (LCS) problem is a classical method of string comparison. Several coa...
In this paper. we show new parallel algorithms for a set of classical string comparison problems. co...
The longest common subsequence (LCS) is a classic and well-studied measure of similarity between tw...
AbstractThe LCS problem is to determine a longest common subsequence (LCS) of two symbol sequences. ...
The constrained longest common subsequence (CLCS) problem was introduced as a specific measure of si...
Abstract. We consider the classic problem of computing (the length of) the longest common subsequenc...
Data compression can be used to simultaneously reduce memory, communication and computation requirem...
AbstractSpace saving techniques in computations of a longest common subsequence (LCS) of two strings...
Given two strings X and Y of lengths m and n, re-spectively, the all-substrings longest common subse...
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem cons...
AbstractA classical measure of similarity between strings is the length of the longest common subseq...
For two strings a, b of lengths m, n, respectively, the longest common subsequence (LCS) problem con...
published in Efficient representation and parallel computation of string-substring longest common su...
This note provides very simple, efficient algorithms for computing the number of distinct longest co...
Although the Longest Common Subsequence (LCS)Problem has been studied by many researchers for years,...
DOI
Add to ORKG