Sciweavers

62 search results - page 1 / 13
» Faster Algorithms for Computing Longest Common Increasing Su...
Sort
View
CPM
2006
Springer
111views Combinatorics» more  CPM 2006»
13 years 8 months ago
Faster Algorithms for Computing Longest Common Increasing Subsequences
Gerth Stølting Brodal, Kanela Kaligosi, Iri...
FCS
2006
13 years 6 months ago
Another Algorithm for Computing Longest Common Increasing Subsequence for Two Random Input Sequences
We have previously developed several algorithms which deal with different input sequence scenarios respectively. In this paper, another sequential algorithm for computing Longest ...
Yongsheng Bai, Bob P. Weems
DATE
2000
IEEE
93views Hardware» more  DATE 2000»
13 years 9 months ago
Fast Evaluation of Sequence Pair in Block Placement by Longest Common Subsequence Computation
In [1], Murata et al introduced an elegant representation of block placement called sequence pair. All block placement algorithms which are based on sequence pairs use simulated a...
Xiaoping Tang, D. F. Wong, Ruiqi Tian
GECCO
2006
Springer
282views Optimization» more  GECCO 2006»
13 years 8 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