Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

32

CPM
2006
Springer

favoriteEmaildiscussreport

111views Combinatorics» more CPM 2006»

Faster Algorithms for Computing Longest Common Increasing Subsequences

14 years 2 months ago

Faster Algorithms for Computing Longest Common Increasing Subsequences

Download www.brics.dk

Gerth Stølting Brodal, Kanela Kaligosi, Iri

Real-time Traffic

Combinatorics | CPM 2006 |

claim paper

Related Content

» Another Algorithm for Computing Longest Common Increasing Subsequence for Two Random Input...

» A linear space algorithm for computing a longest common increasing subsequence

» Fast Evaluation of Sequence Pair in Block Placement by Longest Common Subsequence Computat...

» A genetic algorithm for the longest common subsequence problem

» Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs

» Finding Longest Increasing and Common Subsequences in Streaming Data

» Algorithms for Computing the Longest Parameterized Common Subsequence

» Constrained Longest Common Subsequence Computing Algorithms in Practice

» A New Efficient Algorithm for Computing the Longest Common Subsequence

Post Info
More Details (n/a)

Added	20 Aug 2010
Updated	20 Aug 2010
Type	Conference
Year	2006
Where	CPM
Authors	Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel, Martin Kutz

Comments (0)