AbstractWe consider the length L of the longest common subsequence of two randomly uniformly and independently chosen n character words over a k-ary alphabet. Subadditivity arguments yield that EL/n converges to a constant γk. We prove a conjecture of Sankoff and Mainville from the early 1980s claiming that γkk→2 as k→∞
AbstractWe present algorithms for finding a longest common increasing subsequence of two or more inp...
Given two strings X and Y of N and M characters respectively, the Longest Common Subsequence (LCS) ...
This paper performs the analysis necessary to bound the running time of known, efficient algorithms ...
AbstractWe consider the length L of the longest common subsequence of two randomly uniformly and ind...
We consider the length L of the longest common subsequence of two randomly uniformly and independen...
We consider the length L of the longest common subsequence of two randomly uniformly and independent...
AbstractThe length ln of a longest common subsequence before time n sequences (B11, B12, …) (B21, B2...
in PressInternational audienceLet $X=(X_i)_{i\ge 1}$ and $Y=(Y_i)_{i\ge 1}$ be two sequences of inde...
We present improvements to two techniques to find lower and upper bounds for the expected length of ...
This paper concerns the longest common subsequence (LCS) shared by two sequences (or strings) of len...
This paper investigates the approximability of the Longest Common Subsequence (LCS) problem. The fas...
Let $( x_1 ,x_2 , \cdots x_n )$ and $( x\u27_1 ,x\u27_2 , \cdots x\u27_n , )$ be two strings from an...
International audienceThe longest common subsequence (LCS) problem is a classic and well-studied pro...
This thesis investigates the approximability of the Longest Common Subsequence (LCS) problem. The fa...
A repetition-free Longest Common Subsequence (LCS) of two sequences x and y is an LCS of x and y whe...
AbstractWe present algorithms for finding a longest common increasing subsequence of two or more inp...
Given two strings X and Y of N and M characters respectively, the Longest Common Subsequence (LCS) ...
This paper performs the analysis necessary to bound the running time of known, efficient algorithms ...
AbstractWe consider the length L of the longest common subsequence of two randomly uniformly and ind...
We consider the length L of the longest common subsequence of two randomly uniformly and independen...
We consider the length L of the longest common subsequence of two randomly uniformly and independent...
AbstractThe length ln of a longest common subsequence before time n sequences (B11, B12, …) (B21, B2...
in PressInternational audienceLet $X=(X_i)_{i\ge 1}$ and $Y=(Y_i)_{i\ge 1}$ be two sequences of inde...
We present improvements to two techniques to find lower and upper bounds for the expected length of ...
This paper concerns the longest common subsequence (LCS) shared by two sequences (or strings) of len...
This paper investigates the approximability of the Longest Common Subsequence (LCS) problem. The fas...
Let $( x_1 ,x_2 , \cdots x_n )$ and $( x\u27_1 ,x\u27_2 , \cdots x\u27_n , )$ be two strings from an...
International audienceThe longest common subsequence (LCS) problem is a classic and well-studied pro...
This thesis investigates the approximability of the Longest Common Subsequence (LCS) problem. The fa...
A repetition-free Longest Common Subsequence (LCS) of two sequences x and y is an LCS of x and y whe...
AbstractWe present algorithms for finding a longest common increasing subsequence of two or more inp...
Given two strings X and Y of N and M characters respectively, the Longest Common Subsequence (LCS) ...
This paper performs the analysis necessary to bound the running time of known, efficient algorithms ...
DOI
Add to ORKG