Skip to search formSkip to main contentSkip to account menu

Longest increasing subsequence

Known as: LIS, Longest nondecreasing subsequence, Nondecreasing subsequence 
In computer science, the longest increasing subsequence problem is to find a subsequence of a given sequence in which the subsequence's elements are… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
In this paper, we propose a data structure, a quadruple neighbor list (QN-list, for short), to support real time queries of all… 
2013
2013
In this paper, we construct a data structure to efficiently compute the longest increasing subsequence of a sequence subject to… 
2009
2009
Finding a longest increasing subsequence (LIS) of a given sequence is a classic problem in string matching, with applications… 
2009
2009
  • 2009
  • Corpus ID: 52240579
Given a string X = 〈x1, x2, . . . , xn〉 of n characters drawn from a totally ordered alphabet, an Increasing Subsequence (IS) of… 
2008
2008
Let 〈a1, a2, . . . , an〉 be a sequence of comparable elements. In this paper, we study two constrained versions of the longest… 
2006
2006
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their… 
2006
2006
In this paper, we consider parallel algorithm for the longest increasing subsequence problem. Although this problem is primitive… 
1995
1995
Complementing the results claiming that the maximal length Ln of an increasing subsequence in a random permutation of f ng is… 
1993
1993
We derive a parallel solution to the problem of finding the longest increasing subsequence in a finite sequence of numbers. We…