Add to ORKGGiven 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 nk + cn1−1/(t−k−2), for some c> 0 depending on k and t. This is sharp up to the value of c.
AbstractWe study the following problem. Given two sequences x and y over a finite alphabet, find a r...
Abstract. Given a finite set of strings X, the longest common subsequence problem (LCS) consists in ...
We study the following problem. Given two sequences x and y over a finite alphabet, find a repetitio...
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...
A large family of words must contain two words that are similar. We investigate several problems whe...
AbstractWe consider the length L of the longest common subsequence of two randomly uniformly and ind...
International audienceThe longest common subsequence (LCS) problem is a classic and well-studied pro...
Given two sequences A D a1a2: : : am and B D b1b2: : : bn, m 6 n, over some alphabet of size s the ...
We consider the length L of the longest common subsequence of two randomly uniformly and independent...
A new algorithm that creates a common subsequence automaton for a set of strings is presented. Moreo...
Let X and Y be two finite strings over a finite alphabet Σ. A common subsequence of X and Y is a sub...
Let X and Y be any two sequences over an alphabet Σ, where each pair of elements in Σ is comparable....
This thesis investigates the approximability of the Longest Common Subsequence (LCS) problem. The fa...
Although the Longest Common Subsequence (LCS)Problem has been studied by many researchers for years,...
AbstractWe study the following problem. Given two sequences x and y over a finite alphabet, find a r...
Abstract. Given a finite set of strings X, the longest common subsequence problem (LCS) consists in ...
We study the following problem. Given two sequences x and y over a finite alphabet, find a repetitio...
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...
A large family of words must contain two words that are similar. We investigate several problems whe...
AbstractWe consider the length L of the longest common subsequence of two randomly uniformly and ind...
International audienceThe longest common subsequence (LCS) problem is a classic and well-studied pro...
Given two sequences A D a1a2: : : am and B D b1b2: : : bn, m 6 n, over some alphabet of size s the ...
We consider the length L of the longest common subsequence of two randomly uniformly and independent...
A new algorithm that creates a common subsequence automaton for a set of strings is presented. Moreo...
Let X and Y be two finite strings over a finite alphabet Σ. A common subsequence of X and Y is a sub...
Let X and Y be any two sequences over an alphabet Σ, where each pair of elements in Σ is comparable....
This thesis investigates the approximability of the Longest Common Subsequence (LCS) problem. The fa...
Although the Longest Common Subsequence (LCS)Problem has been studied by many researchers for years,...
AbstractWe study the following problem. Given two sequences x and y over a finite alphabet, find a r...
Abstract. Given a finite set of strings X, the longest common subsequence problem (LCS) consists in ...
We study the following problem. Given two sequences x and y over a finite alphabet, find a repetitio...