Longest alternating subsequence
id:
longest-alternating-subsequence-244-15698702
title:
Longest alternating subsequence
text:
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 x = { x 1 , x 2 , … , x n } is a sequence of distinct real numbers, then the subsequence { x i 1 , x i 2 , … , x i k } is alternating if Similarly, x is reverse alternating if Let a s n denote the length of the longest alter
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Longest_alternating_subsequence
date created:
date modified:
2023-11-23T02:26:44Z
main entity:
{"identifier":"Q17079793","url":"https://www.wikidata.org/entity/Q17079793"}
image:
fields total:
13
integrity:
13