147 search results - page 6 / 30 » Algorithms for Computing the Longest Parameterized Common Su... |
117
Voted
DIS
2006
Springer
15 years 8 months ago
2006
Springer
This paper introduces a new family of string classifiers based on local relatedness. We use three types of local relatedness measurements, namely, longest common substrings (LCStr&...
164
Voted
CATA
2006
15 years 6 months ago
2006
The paper presents a load balancing method for some CGM (Coarse-Grained Multicomputer) algorithms. This method can be applied on different dynamic programming problems such as: Lo...
131
Voted
SPIRE
2001
Springer
15 years 9 months ago
2001
Springer
Two algorithms are presented that solve the problem of recovering the longest common subsequence of two strings. The £rst algorithm is an improvement of Hirschberg’s divide-andc...
152
Voted
FOCS
2007
IEEE
15 years 11 months ago
2007
IEEE
We show that any deterministic data-stream algorithm that makes a constant number of passes over the input and gives a constant factor approximation of the length of the longest i...
131
click to vote
IWPEC
2004
Springer
15 years 10 months ago
2004
Springer
Based on a series of known and new examples, we propose the generalized setting of “distance from triviality” measurement as a reasonable and prospective way of determining use...