Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,294 papers from all fields of science
Search
Sign In
Create Free Account
Longest increasing subsequence
Known as:
LIS
, Longest nondecreasing subsequence
, Nondecreasing subsequence
Expand
In computer science, the longest increasing subsequence problem is to find a subsequence of a given sequence in which the subsequence's elements are…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
18 relations
Algorithmics
Binary logarithm
Clique (graph theory)
Clique problem
Expand
Broader (1)
Dynamic programming
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Computing Longest Increasing Subsequences over Sequential Data Streams
Youhuan Li
,
Lei Zou
,
Huaming Zhang
,
Dongyan Zhao
Proceedings of the VLDB Endowment
2016
Corpus ID: 1719963
In this paper, we propose a data structure, a quadruple neighbor list (QN-list, for short), to support real time queries of all…
Expand
2013
2013
The Dynamic Longest Increasing Subsequence Problem
Alex Chen
,
T. Chu
,
N. Pinsker
2013
Corpus ID: 1037599
In this paper, we construct a data structure to efficiently compute the longest increasing subsequence of a sequence subject to…
Expand
2009
2009
On Two Variants of the Longest Increasing Subsequence Problem
Sebastian Deorowicz
,
S. Grabowski
International Conference on Man-Machine…
2009
Corpus ID: 28098309
Finding a longest increasing subsequence (LIS) of a given sequence is a classic problem in string matching, with applications…
Expand
2009
2009
The Longest Increasing Subsequence Problem
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…
Expand
2008
2008
Fast Algorithms for the Constrained Longest Increasing Subsequence Problems
I-Hsuan Yang
,
Yi-Ching Chen
2008
Corpus ID: 8806468
Let 〈a1, a2, . . . , an〉 be a sequence of comparable elements. In this paper, we study two constrained versions of the longest…
Expand
2006
2006
Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs
A. Tiskin
Annual Symposium on Combinatorial Pattern…
2006
Corpus ID: 5894064
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their…
Expand
2006
2006
A CGM Algorithm Solving the Longest Increasing Subsequence Problem
D. Semé
Communication Systems and Applications
2006
Corpus ID: 9609662
In this paper, we consider parallel algorithm for the longest increasing subsequence problem. Although this problem is primitive…
Expand
1995
1995
ON THE LENGTH OF THE LONGEST INCREASING SUBSEQUENCE IN A RANDOM PERMUTATION
S. Janson
1995
Corpus ID: 9107827
Complementing the results claiming that the maximal length Ln of an increasing subsequence in a random permutation of f ng is…
Expand
1993
1993
An efficient parallel solution for the longest increasing subsequence problem
C. Cérin
,
C. Dufourd
,
J. Myoupo
International Conference on Computing and…
1993
Corpus ID: 41687707
We derive a parallel solution to the problem of finding the longest increasing subsequence in a finite sequence of numbers. We…
Expand
1984
1984
Distance functions defined by variable neighborhood sequences
M. Yamashita
,
N. Honda
Pattern Recognition
1984
Corpus ID: 28408909
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE