<p>Given a set of t ≥ k + 2 words of length n over a k-letter alphabet, it is proved that there exists a common subsequence among two of them of length at least n/k + cn<sup>1−1/(t−k−2)</sup> for some c > 0 depending on k and t. This is sharp up to the value of c.</p
AbstractWe study the following problem. Given two sequences x and y over a finite alphabet, find a r...
Although the Longest Common Subsequence (LCS)Problem has been studied by many researchers for years,...
AbstractFor a fixed subset An of the set Cn of words of length n over an alphabet with n symbols the...
Given a set of t ≥ k + 2 words of length n over a k-letter alphabet, it is proved that there exists ...
Given a set of t ≥ k + 2 words of length n over a k-letter alphabet, it is proved that there exists ...
We consider the length L of the longest common subsequence of two randomly uniformly and independen...
AbstractWe consider the length L of the longest common subsequence of two randomly uniformly and ind...
A large family of words must contain two words that are similar. We investigate several problems whe...
We consider the length L of the longest common subsequence of two randomly uniformly and independent...
Given two sequences A D a1a2: : : am and B D b1b2: : : bn, m 6 n, over some alphabet of size s the ...
International audienceThe longest common subsequence (LCS) problem is a classic and well-studied pro...
A new algorithm that creates a common subsequence automaton for a set of strings is presented. Moreo...
Let X and Y be any two sequences over an alphabet Σ, where each pair of elements in Σ is comparable....
Let X and Y be two finite strings over a finite alphabet Σ. A common subsequence of X and Y is a sub...
This thesis investigates the approximability of the Longest Common Subsequence (LCS) problem. The fa...
AbstractWe study the following problem. Given two sequences x and y over a finite alphabet, find a r...
Although the Longest Common Subsequence (LCS)Problem has been studied by many researchers for years,...
AbstractFor a fixed subset An of the set Cn of words of length n over an alphabet with n symbols the...
Given a set of t ≥ k + 2 words of length n over a k-letter alphabet, it is proved that there exists ...
Given a set of t ≥ k + 2 words of length n over a k-letter alphabet, it is proved that there exists ...
We consider the length L of the longest common subsequence of two randomly uniformly and independen...
AbstractWe consider the length L of the longest common subsequence of two randomly uniformly and ind...
A large family of words must contain two words that are similar. We investigate several problems whe...
We consider the length L of the longest common subsequence of two randomly uniformly and independent...
Given two sequences A D a1a2: : : am and B D b1b2: : : bn, m 6 n, over some alphabet of size s the ...
International audienceThe longest common subsequence (LCS) problem is a classic and well-studied pro...
A new algorithm that creates a common subsequence automaton for a set of strings is presented. Moreo...
Let X and Y be any two sequences over an alphabet Σ, where each pair of elements in Σ is comparable....
Let X and Y be two finite strings over a finite alphabet Σ. A common subsequence of X and Y is a sub...
This thesis investigates the approximability of the Longest Common Subsequence (LCS) problem. The fa...
AbstractWe study the following problem. Given two sequences x and y over a finite alphabet, find a r...
Although the Longest Common Subsequence (LCS)Problem has been studied by many researchers for years,...
AbstractFor a fixed subset An of the set Cn of words of length n over an alphabet with n symbols the...
DOI
Add to ORKG