- Source: Longest increasing subsequence
In computer science, the longest increasing subsequence problem aims to find a subsequence of a given sequence in which the subsequence's elements are sorted in an ascending order and in which the subsequence is as long as possible. This subsequence is not necessarily contiguous or unique. The longest increasing subsequences are studied in the context of various disciplines related to mathematics, including algorithmics, random matrix theory, representation theory, and physics. The longest increasing subsequence problem is solvable in time
O
(
n
log
n
)
,
{\displaystyle O(n\log n),}
where
n
{\displaystyle n}
denotes the length of the input sequence.
Example
In the first 16 terms of the binary Van der Corput sequence
0, 8, 4, 12, 2, 10, 6, 14, 1, 9, 5, 13, 3, 11, 7, 15
one of the longest increasing subsequences is
0, 2, 6, 9, 11, 15.
This subsequence has length six; the input sequence has no seven-member increasing subsequences. The longest increasing subsequence in this example is not the only solution: for instance,
0, 4, 6, 9, 11, 15
0, 2, 6, 9, 13, 15
0, 4, 6, 9, 13, 15
are other increasing subsequences of equal length in the same input sequence.
Relations to other algorithmic problems
The longest increasing subsequence problem is closely related to the longest common subsequence problem, which has a quadratic time dynamic programming solution: the longest increasing subsequence of a sequence
S
{\displaystyle S}
is the longest common subsequence of
S
{\displaystyle S}
and
T
,
{\displaystyle T,}
where
T
{\displaystyle T}
is the result of sorting
S
.
{\displaystyle S.}
However, for the special case in which the input is a permutation of the integers
1
,
2
,
…
,
n
,
{\displaystyle 1,2,\ldots ,n,}
this approach can be made much more efficient, leading to time bounds of the form
O
(
n
log
log
n
)
.
{\displaystyle O(n\log \log n).}
The largest clique in a permutation graph corresponds to the longest decreasing subsequence of the permutation that defines the graph (assuming the original non-permuted sequence is sorted from lowest value to highest). Similarly, the maximum independent set in a permutation graph corresponds to the longest non-decreasing subsequence. Therefore, longest increasing subsequence algorithms can be used to solve the clique problem efficiently in permutation graphs.
In the Robinson–Schensted correspondence between permutations and Young tableaux, the length of the first row of the tableau corresponding to a permutation equals the length of the longest increasing subsequence of the permutation, and the length of the first column equals the length of the longest decreasing subsequence.
Efficient algorithms
The algorithm outlined below solves the longest increasing subsequence problem efficiently with arrays and binary searching.
It processes the sequence elements in order, maintaining the longest increasing subsequence found so far. Denote the sequence values as
X
[
0
]
,
X
[
1
]
,
…
,
{\displaystyle X[0],X[1],\ldots ,}
etc. Then, after processing
X
[
i
]
,
{\displaystyle X[i],}
the algorithm will have stored an integer
L
{\displaystyle L}
and values in two arrays:
L
{\displaystyle L}
— stores the length of the longest increasing subsequence found so far.
M
[
l
]
{\displaystyle M[l]}
— stores the index
k
{\displaystyle k}
of the smallest value
X
[
k
]
{\displaystyle X[k]}
such that there is an increasing subsequence of length
l
{\displaystyle l}
ending at
X
[
k
]
{\displaystyle X[k]}
in the range
k
≤
i
.
{\displaystyle k\leq i.}
Explicitly, suppose that
K
i
,
l
{\displaystyle K_{i,l}}
denotes the set of all indices
j
{\displaystyle j}
such that
j
≤
i
{\displaystyle j\leq i}
and there exists an increasing subsequence of length
l
{\displaystyle l}
ending at
X
[
j
]
.
{\displaystyle X[j].}
Then
k
=
M
[
l
]
{\displaystyle k=M[l]}
is the index in
K
i
,
l
{\displaystyle K_{i,l}}
for which
X
[
M
[
l
]
]
{\displaystyle X[M[l]]}
is minimized; meaning that
M
[
l
]
∈
K
i
,
l
{\displaystyle M[l]\in K_{i,l}}
and
X
[
M
[
l
]
]
=
min
j
∈
K
i
,
l
X
[
j
]
{\displaystyle X[M[l]]=\min _{j\in K_{i,l}}X[j]}
(or equivalently,
M
[
l
]
∈
K
i
,
l
{\displaystyle M[l]\in K_{i,l}}
and for every
j
∈
K
i
,
l
,
{\displaystyle j\in K_{i,l},}
X
[
M
[
l
]
]
≤
X
[
j
]
{\displaystyle X[M[l]]\leq X[j]}
); if multiple indices satisfy this condition then
M
[
l
]
{\displaystyle M[l]}
is the largest one.
To clarify, "there exists an increasing subsequence of length
l
{\displaystyle l}
ending at
X
[
k
]
{\displaystyle X[k]}
" means that there exist
l
{\displaystyle l}
indices
i
1
<
i
2
<
⋯
<
i
l
=
k
{\displaystyle i_{1}
ending at
k
{\displaystyle k}
such that
X
[
i
1
]
<
X
[
i
2
]
<
⋯
<
X
[
k
]
.
{\displaystyle X\left[i_{1}\right]
Note that
1
≤
l
≤
i
+
1
,
{\displaystyle 1\leq l\leq i+1,}
because
l
≥
1
{\displaystyle l\geq 1}
represents the length of the increasing subsequence, and
k
≥
0
{\displaystyle k\geq 0}
represents the index of its termination.
The length of
M
{\displaystyle M}
is
1
{\displaystyle 1}
more than the length of
X
{\displaystyle X}
but it is possible that not all elements in this array are used by the algorithm (in fact, if the longest increasing sequence has length
L
{\displaystyle L}
then only
M
[
1
]
,
…
,
M
[
L
]
{\displaystyle M[1],\ldots ,M[L]}
are used by the algorithm). If however
M
[
l
]
{\displaystyle M[l]}
is used/defined then
l
−
1
≤
M
[
l
]
{\displaystyle l-1\leq M[l]}
(and moreover, at iteration
i
,
{\displaystyle i,}
M
[
l
]
≤
i
{\displaystyle M[l]\leq i}
will also hold).
M
[
0
]
{\displaystyle M[0]}
is undefined since sequences of length
0
{\displaystyle 0}
have no ending index (
M
[
0
]
{\displaystyle M[0]}
can be any value).
P
[
k
]
{\displaystyle P[k]}
— stores the index of the predecessor of
X
[
k
]
{\displaystyle X[k]}
in the longest increasing subsequence ending at
X
[
k
]
.
{\displaystyle X[k].}
The length of
P
{\displaystyle P}
is equal to that of
X
,
{\displaystyle X,}
If
k
>
0
{\displaystyle k>0}
then
P
[
k
]
<
k
{\displaystyle P[k]
while
P
[
0
]
{\displaystyle P[0]}
is undefined since
X
[
0
]
{\displaystyle X[0]}
has no predecessor (
P
[
0
]
{\displaystyle P[0]}
can be any value).
Because the algorithm below uses zero-based numbering, for clarity
M
{\displaystyle M}
is padded with
M
[
0
]
,
{\displaystyle M[0],}
which goes unused so that
M
[
l
]
{\displaystyle M[l]}
corresponds to a subsequence of length
l
.
{\displaystyle l.}
A real implementation can skip
M
[
0
]
{\displaystyle M[0]}
and adjust the indices accordingly.
Note that, at any point in the algorithm, the sequence
X
[
M
[
1
]
]
,
X
[
M
[
2
]
]
,
…
,
X
[
M
[
L
]
]
{\displaystyle X[M[1]],X[M[2]],\ldots ,X[M[L]]}
is increasing. For, if there is an increasing subsequence of length
l
≥
2
{\displaystyle l\geq 2}
ending at
X
[
M
[
l
]
]
,
{\displaystyle X[M[l]],}
then there is also a subsequence of length
l
−
1
{\displaystyle l-1}
ending at a smaller value: namely the one ending at
X
[
P
[
M
[
l
]
]
]
.
{\displaystyle X[P[M[l]]].}
Thus, we may do binary searches in this sequence in logarithmic time.
The algorithm, then, proceeds as follows:
P = array of length N
M = array of length N + 1
M[0] = -1 // undefined so can be set to any value
L = 0
for i in range 0 to N-1: //N-1 included
// Binary search for the smallest positive l ≤ L
// such that X[M[l]] >= X[i]
lo = 1
hi = L + 1
while lo < hi:
mid = lo + floor((hi-lo)/2) // lo <= mid < hi
if X[M[mid]] >= X[i]
hi = mid
else: // if X[M[mid]] < X[i]
lo = mid + 1
// After searching, lo == hi is 1 greater than the
// length of the longest prefix of X[i]
newL = lo
// The predecessor of X[i] is the last index of
// the subsequence of length newL-1
P[i] = M[newL-1]
M[newL] = i
if newL > L:
// If we found a subsequence longer than any we've
// found yet, update L
L = newL
// Reconstruct the longest increasing subsequence
// It consists of the values of X at the L indices:
// ..., P[P[M[L]]], P[M[L]], M[L]
S = array of length L
k = M[L]
for j in range L-1 to 0: //0 included
S[j] = X[k]
k = P[k]
return S
Because the algorithm performs a single binary search per sequence element, its total time can be expressed using Big O notation as
O
(
n
log
n
)
.
{\displaystyle O(n\log n).}
Fredman (1975) discusses a variant of this algorithm, which he credits to Donald Knuth; in the variant that he studies, the algorithm tests whether each value
X
[
i
]
{\displaystyle X[i]}
can be used to extend the current longest increasing sequence, in constant time, prior to doing the binary search. With this modification, the algorithm uses at most
n
log
2
n
−
n
log
2
log
2
n
+
O
(
n
)
{\displaystyle n\log _{2}n-n\log _{2}\log _{2}n+O(n)}
comparisons in the worst case, which is optimal for a comparison-based algorithm up to the constant factor in the
O
(
n
)
{\displaystyle O(n)}
term.
Example run
Length bounds
According to the Erdős–Szekeres theorem, any sequence of
n
2
+
1
{\displaystyle n^{2}+1}
distinct integers has an increasing or a decreasing subsequence of length
n
+
1.
{\displaystyle n+1.}
For inputs in which each permutation of the input is equally likely, the expected length of the longest increasing subsequence is approximately
2
n
.
{\displaystyle 2{\sqrt {n}}.}
In the limit as
n
{\displaystyle n}
approaches infinity, the Baik-Deift-Johansson theorem says, that the length of the longest increasing subsequence of a randomly permuted sequence of
n
{\displaystyle n}
items has a distribution approaching the Tracy–Widom distribution, the distribution of the largest eigenvalue of a random matrix in the Gaussian unitary ensemble.
Online algorithms
The longest increasing subsequence has also been studied in the setting of online algorithms, in which the elements of a sequence of independent random variables with continuous distribution
F
{\displaystyle F}
– or alternatively the elements of a random permutation – are presented one at a time to an algorithm that must decide whether to include or exclude each element, without knowledge of the later elements. In this variant of the problem, which allows for interesting applications in several contexts, it is possible to devise an optimal selection procedure that, given a random sample of size
n
{\displaystyle n}
as input, will generate an increasing sequence with maximal expected length of size approximately
2
n
.
{\displaystyle {\sqrt {2n}}.}
The length of the increasing subsequence selected by this optimal procedure has variance approximately equal to
2
n
/
3
,
{\displaystyle {\sqrt {2n}}/3,}
and its limiting distribution is asymptotically normal after the usual centering and scaling.
The same asymptotic results hold with more precise bounds for the corresponding problem in the setting of a Poisson arrival process.
A further refinement in the Poisson process setting is given through the proof of a central limit theorem for the optimal selection process
which holds, with a suitable normalization, in a more complete sense than one would expect. The proof yields not only the "correct" functional limit theorem
but also the (singular) covariance matrix of the three-dimensional process summarizing all interacting processes.
See also
Anatoly Vershik – Russian mathematician (1933–2024) who studied applications of group theory to longest increasing subsequences in random permutations.
Longest alternating subsequence
Longest common subsequence – Algorithmic problem on pairs of sequences
Patience sorting – Sorting algorithm − an efficient technique for finding the length of the longest increasing subsequence
Plactic monoid – monoid of positive integers modulo Knuth equivalencePages displaying wikidata descriptions as a fallback − an algebraic system defined by transformations that preserve the length of the longest increasing subsequence
References
External links
Algorithmist's Longest Increasing Subsequence
Simplified Longest Increasing Subsequence
Finding count of longest increased subsequences
Kata Kunci Pencarian:
- Longest increasing subsequence
- Longest common subsequence
- Patience sorting
- Subsequence
- Kingman's subadditive ergodic theorem
- Hook length formula
- Longest alternating subsequence
- Erdős–Szekeres theorem
- Plancherel measure
- Baik–Deift–Johansson theorem
