Longest Increasing Subsequences in Windows Based o…….pptVIP

* * Future Works… Questions? * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * Longest Increasing Subsequences in WindowsBased on Canonical Antichain Partition Erdong Chen (Joint work with Linji Yang Hao Yuan) Shanghai Jiao Tong Univ. Outline Problem Definition Canonical Antichain Partition Sweep Algorithm Complexity Analysis Conclusion Longest Increasing Subsequence (LIS) 6 9 8 2 3 5 1 4 7 2 3 4 7 2 3 5 7 Input sequence: All Longest Increasing Subsequences: LIS in a Window 6 9 8 2 3 5 1 4 7 6 9 8 The length of LIS within the window is 2 6 9 Sequence a Window Lon