[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
longuest interleaved sequences
|
From: |
CdeMills |
|
Subject: |
longuest interleaved sequences |
|
Date: |
Thu, 20 May 2010 07:23:48 -0700 (PDT) |
Hello,
problem is as follows: given two ordered sequences x and y (x1 <= x2 <= ...
xn; y1 <= y2 <= ym),
extract the longuest subsequences xs and ys of the same length such that,
for each element,
x_i <= y_i <= x_{i+1}
I have a few ideas, but if others already came with a fast and efficient
algorithm, please share your thoughs.
Regards
Pascal
--
View this message in context:
http://octave.1599824.n4.nabble.com/longuest-interleaved-sequences-tp2224627p2224627.html
Sent from the Octave - General mailing list archive at Nabble.com.
- longuest interleaved sequences,
CdeMills <=