Longest alternating subsequence

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In combinatorial mathematics, probability, and computer science, in the longest alternating subsequence problem, one wants to find a subsequence of a given sequence in which the elements are in alternating order, and in which the sequence is as long as possible.

Formally, if \mathbf{x} = \{x_1, x_2, \ldots, x_n\} is a sequence of distinct real numbers, then the subsequence \{x_{i_1}, x_{i_2}, \ldots, x_{i_k}\} is alternating[1] (or zigzag or down-up)if

x_{i_1} > x_{i_2} < x_{i_3} > \cdots  x_{i_k}\qquad \text{and} \qquad 1\leq i_1 < i_2 < \cdots < i_k \leq n.

Similarly, \mathbf{x} is reverse alternating (or up-down) if

x_{i_1} < x_{i_2} > x_{i_3} < \cdots  x_{i_k}\qquad \text{and} \qquad 1\leq i_1 < i_2 < \cdots < i_k \leq n.

Let {\rm as}_n(\mathbf{x}) denote the length (number of terms) of the longest alternating subsequence of \mathbf{x}. For example, if we consider some of the permutations of the integers 1,2,3,4,5, we have that

  • {\rm as}_5(1,2,3,4,5) = 1 ;
  • {\rm as}_5(1,5,3,2,4) = 4, because 1,5,3,4 and 1,5,2,4 and 1,3,2,4 are all alternating, and there is no alternating subsequence with more elements;
  • {\rm as}_5(5,3,4,1,2) = 5, because 5,3,4,1,2 is itself alternating.

Efficient algorithms[edit]

The longest alternating subsequence problem is solvable in time O(n), where n is the length of the original sequence.

Distributional results[edit]

If \mathbf{x} is a random permutation of the integers 1,2,\ldots,n and A_n \equiv {\rm as}_n(\mathbf{x}), then it is possible to show[2][3][4] that

 E[A_n] = \frac{2 n}{3} + \frac{1}{6}  \qquad \text{and} \qquad \operatorname{Var}[A_n] = \frac{8 n}{45} - \frac{13}{180}.

Moreover, as n \rightarrow \infty, the random variable A_n, appropriately centered and scaled, converges to a standard normal distribution.

Online algorithms[edit]

The longest alternating subsequence problem has also been studied in the setting of online algorithms, in which the elements of \mathbf{x} are presented in an online fashion, and a decision maker needs to decide whether to include or exclude each element at the time it is first presented, without any knowledge of the elements that will be presented in the future, and without the possibility of recalling on preceding observations.

Given a sequence X_1, X_2, \ldots, X_n of independent random variables with common continuous distribution F, it is possible to construct a selection procedure that maximizes the expected number of alternating selections. Such expected values can be tightly estimated, and it equals (2-\sqrt{2})n + O(1).[5]

As n \rightarrow \infty, the optimal number of online alternating selections appropriately centered and scaled converges to a normal distribution.[6]

See also[edit]

References[edit]

  1. ^ Stanley, Richard P. (2011), Enumerative Combinatorics, Volume I, second edition, Cambridge University Press 
  2. ^ Widom, Harold (2006), "On the limiting distribution for the length of the longest alternating sequence in a random permutation", Electron. J. Combin. 13: Research Paper 25, 7 
  3. ^ Stanley, Richard P. (2008), "Longest alternating subsequences of permutations", Michigan Math. J. 57: 675–687, doi:10.1307/mmj/1220879431 
  4. ^ Houdré, Christian; Restrepo, Ricardo (2010), "A probabilistic approach to the asymptotics of the length of the longest alternating subsequence", Electron. J. Combin. 17: Research Paper 168, 19 
  5. ^ Arlotto, Alessandro; Chen, Robert W.; Shepp, Lawrence A.; Steele, J. Michael (2011), "Online selection of alternating subsequences from a random sample", J. Appl. Probab. 48 (4): 1114–1132, doi:10.1239/jap/1324046022 
  6. ^ Arlotto, Alessandro; Steele, J. Michael (2014), "Optimal online selection of an alternating subsequence: a central limit theorem", Adv. in Appl. Probab. 46 (2): 536–559, doi:10.1239/aap/1401369706