| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 436109 | Theoretical Computer Science | 2007 | 14 Pages |
Abstract
Given a sequence π1π2…πn, a longest increasing subsequence (LIS) in a window π〈l,r〉=πlπl+1…πr is a longest subsequence σ=πi1πi2…πiT such that l≤i1
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
