Longest increasing subsequences in windows based on canonical antichain partition

Theoretical Computer Science

Volumn 378, Issue 3, 2007, Pages 223-236

  Chen, Erdong ^a   Yang, Linji ^a   Yuan, Hao ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

Canonical antichain partition; Data streaming model; Longest increasing subsequences

Indexed keywords

ALGORITHMS; NUMERICAL METHODS; PROBLEM SOLVING; SENSITIVITY ANALYSIS;

CANONICAL ANTICHAIN PARTITION; DATA STREAMING MODELS; LONGEST INCREASING SUBSEQUENCES; OPTIMAL OUTPUT SENSITIVE ALGORITHMS;

WINDOWS OPERATING SYSTEM;

EID: 34248394264     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.02.032     Document Type: Article

References (12)

1. Albert M.H., Golynski A., Hamel A.M., López-Ortiz A., Srinivasa Rao S., and Ali Safari M. Longest increasing subsequences in sliding windows. Theoret. Comput. Sci. 321 2-3 (2004) 405-414
2. Apostolico A., Atallah M.J., and Hambrusch S.E. New clique and independent set algorithms for circle graphs (Discrete Appl. Math. 36 (1992) 1-24). Discrete Appl. Math. 41 2 (1993) 179-180
3. Bespamyatnikh S., and Segal M. Enumerating longest increasing subsequences and patience sorting. Inf. Process. Lett. 76 1-2 (2000) 7-11
4. Felsner S., and Wernisch L. Maximum k-chains in planar point sets: Combinatorial structure and algorithms. SIAM J. Comput. 28 1 (1998) 192-209
5. Fredman M.~L. On computing the length of longest increasing subsequences. Discrete Math. 11 (1975) 29-35
6. M.R. Henzinger, P. Raghavan, S. Rajagopalon, Computing on data streams, Technical Report 1998-011, Digital Equipment Corporation, Systems Research Center, May 1998
7. Knuth D.E. Sorting and Searching. second ed. The Art of Computer Programming vol. 3 (1998), Addison-Wesley
8. David Liben-Nowell, Erik Vee, An Zhu, Finding longest increasing and common subsequences in streaming data. Technical Report MIT-LCS-931, Cambridge, MA 02139, November 2003
9. Schensted C. Longest increasing and decreasing subsequences. Canadian J. Math. (1961)
10. Smith T.F., and Waterman M.S. Comparison of biosequences. Adv. Appl. Math. 2 (1981) 482-489
11. van Emde Boas P. Preserving order in a forest in less than logarithmic time and linear space. Inf. Process. Lett. 6 3 (1977) 80-82
12. Zhang H. Alignment of blast high-scoring segment pairs based on the longest increasing subsequence algorithm. Bioinformatics 19 11 (2003) 1391-1396