Longest increasing subsequences in sliding windows

Theoretical Computer Science

Volumn 321, Issue 2-3, 2004, Pages 405-414

  Albert, Michael H ^a   Golynski, Alexander ^b   Hamel, Angèle M ^c   López Ortiz, Alejandro ^b   Rao, S Srinivasa ^b   Safari, Mohammad Ali ^b  

^a UNIVERSITY OF OTAGO   (New Zealand)

^b UNIVERSITY OF WATERLOO   (Canada)

^c WILFRID LAURIER UNIVERSITY   (Canada)

Author keywords

Longest increasing subsequence; Robinson Schensted Knuth; Sliding window

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; DATA PROCESSING; DATA STRUCTURES; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; SET THEORY;

LONGEST INCREASING SUBSEQUENCE; OUTPUT-SENSITIVE OPTIMAL SOLUTIONS; ROBINSON-SCHENSTED-KNUTH; SLIDING WINDOWS;

COMBINATORIAL MATHEMATICS;

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

References (16)

1. Aldous D., Diaconis P. Longest increasing subsequences. from patience sorting to the Baik-Deift-Johansson theorem Bull. Am. Math. Soc. 36:1999;413-432.
2. Apostolico A., Atallah M.J., Hambrusch S.E. New clique and independent set algorithms for circle graphs. Discrete Appl. Math. 36:1992;1-24.
3. Bespamyatnikh S., Segal M. Enumerating longest increasing subsequences and patience sorting. Inform. Process. Lett. 76:2000;7-11.
4. Chang M.-S., Wang F.-H. Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs. Inform. Process. Lett. 43:1992;293-295.
5. M. Datar, A. Gionis, P. Indyk, R. Motwani, Maintaining Stream Statistics over Sliding Windows, ACM-SIAM Symposium on Discrete Algorithms (SODA), 2002.
6. Delcher A.L., Kasif S., Feischmann R.D., Peterson J., White O., Salzberg S.L. Alignment of whole genomes. Nucl. Acids Res. 27:1999;2369-2376.
7. P.B. Gibbons, S. Tirthapura, Distributed Streams Algorithms for Sliding Windows, Proceedings of the 14th ACM Symposium on Parallel Algs. and Architectures (SPAA), 2002, pp. 63-72.
8. Groeneboom P. Hydrodynamical methods for analyzing longest increasing subsequences. J. Comp. Appl. Math. 142:2002;83-105.
9. Hunt J., Szymanski T. A fast algorithm for computing longest common subsequences. Comm. ACM. 20:1977;350-353.
10. Knuth D.E. Permutations, matrices, and generalized Young tableaux. Pacific J. Math. 34:1970;709-727.
11. D.E. Knuth, The Art of Computer Programming, Vol. 3, Sorting and Searching, Addison-Wesley, Reading, Mass, 1973.
12. de B. Robinson G. On representations of the symmetric group. Am. J. Math. 60:1938;745-760.
13. Sagan B. The Symmetric Group. 1991;Wadsworth and Brooks/Cole, Pacific Grove, Calf.
14. Schensted C. Longest increasing and decreasing subsequences. Can. J. Math. 13:1961;179-191.
15. van Emde Boas P., Kaas R., Zijlstra E. Design and implementation of an efficient priority queue. Math. Systems Theory. 10(2):1976/77;99-127.
16. Van Leeuwen M. The Robinson-Schensted and Schüzenberger algorithms, an elementary approach. Electron. J. Comb. Foata Festschrift. 3(2):1996;R15.