Sciweavers

17 search results - page 1 / 4
» Heaviest Increasing Common Subsequence Problems
Sort
View
CPM
1992
Springer
200views Combinatorics» more  CPM 1992»
13 years 7 months ago
Heaviest Increasing/Common Subsequence Problems
Guy Jacobson, Kiem-Phong Vo
COCOON
2005
Springer
13 years 9 months ago
Finding Longest Increasing and Common Subsequences in Streaming Data
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...
David Liben-Nowell, Erik Vee, An Zhu
GECCO
2006
Springer
282views Optimization» more  GECCO 2006»
13 years 7 months ago
A genetic algorithm for the longest common subsequence problem
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
Brenda Hinkemeyer, Bryant A. Julstrom
CPM
2006
Springer
176views Combinatorics» more  CPM 2006»
13 years 7 months ago
Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisat...
Alexandre Tiskin
CATA
2006
13 years 5 months ago
A Load Balancing Technique for Some Coarse-Grained Multicomputer Algorithms
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...
Thierry Garcia, David Semé