Finding Longest Increasing and Common Subsequences in Streaming Data

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.

Bibliographic Details
Main Authors: Liben-Nowell, David, Vee, Erik, Zhu, An
Language:en_US
Published: 2005
Online Access:http://hdl.handle.net/1721.1/30435

Similar Items

Similar Items