147 search results - page 5 / 30 » Algorithms for Computing the Longest Parameterized Common Su... |
COCOON
2005
Springer
15 years 3 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...
BIBE
2007
IEEE
15 years 3 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...
ENDM
2008
14 years 9 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...
CTRSA
2009
Springer
15 years 1 months ago
2009
Springer
We design communication efficient two-party and multi-party protocols for the longest common subsequence (LCS) and related problems. Our protocols achieve privacy with respect to p...
78
Voted
IJCAI
2007
14 years 11 months ago
2007
Time series data abounds in real world problems. Measuring the similarity of time series is a key to solving these problems. One state of the art measure is the longest common sub...