It is well known that, when normalized by n, the expected length of a longest common subsequence of d sequences of length n over an alphabet of size σ converges to a constant γσ,d. We disprove a speculation by Steele regarding a possible relation between γ2,d and γ2,2. In order to do that we also obtain some new lower bounds for γσ,d, when both σ and d are small integers
AbstractThe problems considered here deal with the distribution of the lengths of the longest monoto...
The Longest common subsequence problem is examined from the point of view of parameterized computati...
One of the oustanding open problems at the heart of gapped sequence alignment is the longest common ...
Let f(n, k, l) be the expected length of a longest common subsequence of l sequences of length n ove...
AbstractWe consider the length L of the longest common subsequence of two randomly uniformly and ind...
AbstractThe length ln of a longest common subsequence before time n sequences (B11, B12, …) (B21, B2...
We present improvements to two techniques to find lower and upper bounds for the expected length of...
Let X and Y be any two sequences over an alphabet Σ, where each pair of elements in Σ is comparable....
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...
We present improvements to two techniques to find lower and upper bounds for the expected length of ...
Let X and Y be two finite strings over a finite alphabet Σ. A common subsequence of X and Y is a sub...
This paper concerns the longest common subsequence (LCS) shared by two sequences (or strings) of len...
Let a1, a2,. be a sequence of integers and let D = {d1…d2} be a fixed finite set of integers. For ea...
AbstractWe obtain sharp upper and lower bounds on the maximal length λs(n) of (n, s)-Davenport-Schin...
AbstractThe problems considered here deal with the distribution of the lengths of the longest monoto...
The Longest common subsequence problem is examined from the point of view of parameterized computati...
One of the oustanding open problems at the heart of gapped sequence alignment is the longest common ...
Let f(n, k, l) be the expected length of a longest common subsequence of l sequences of length n ove...
AbstractWe consider the length L of the longest common subsequence of two randomly uniformly and ind...
AbstractThe length ln of a longest common subsequence before time n sequences (B11, B12, …) (B21, B2...
We present improvements to two techniques to find lower and upper bounds for the expected length of...
Let X and Y be any two sequences over an alphabet Σ, where each pair of elements in Σ is comparable....
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...
We present improvements to two techniques to find lower and upper bounds for the expected length of ...
Let X and Y be two finite strings over a finite alphabet Σ. A common subsequence of X and Y is a sub...
This paper concerns the longest common subsequence (LCS) shared by two sequences (or strings) of len...
Let a1, a2,. be a sequence of integers and let D = {d1…d2} be a fixed finite set of integers. For ea...
AbstractWe obtain sharp upper and lower bounds on the maximal length λs(n) of (n, s)-Davenport-Schin...
AbstractThe problems considered here deal with the distribution of the lengths of the longest monoto...
The Longest common subsequence problem is examined from the point of view of parameterized computati...
One of the oustanding open problems at the heart of gapped sequence alignment is the longest common ...