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.
| Principais autores: | , , |
|---|---|
| Idioma: | en_US |
| Publicado em: |
2005
|
| Acesso em linha: | http://hdl.handle.net/1721.1/30435 |