Finding Longest Increasing and Common Subsequences in Streaming Data

Author(s)
Liben-Nowell, David; Vee, Erik; Zhu, An
Thumbnail
DownloadMIT-CSAIL-TR-2003-030.ps (19175Kb)
Additional downloads
Metadata
Show full item record
Abstract
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.
Date issued
2003-11-26
URI
http://hdl.handle.net/1721.1/30435
Other identifiers
MIT-CSAIL-TR-2003-030
MIT-LCS-TR-931
Series/Report no.
Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory
Collections