123 search results - page 4 / 25 » Algorithms for computing variants of the longest common subs... |
IPL
2006
13 years 7 months ago
2006
SPIRE
2010
Springer
13 years 6 months ago
2010
Springer
The Longest Common Subsequence (LCS) of two or more strings is a fundamental well-studied problem which has a wide range of applications throughout computational sciences. When the...
BIBE
2007
IEEE
14 years 2 months ago
2007
IEEE
—We investigate the k-LCS problem that is finding a longest common subsequence (LCS) for k given input strings. The problem is known to have practical solutions for k = 2, but f...
COCOON
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we present algorithms and lower bounds for the Longest Increasing Subsequence (LIS) and Longest Common Subsequence (LCS) problems in the data streaming model. For t...
ENDM
2008
13 years 7 months ago
2008
We study the problem of, given two sequences x and y over a finite alphabet, finding a repetitionfree longest common subsequence of x and y. We show several algorithmic results, a...