Subsequence

This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these template messages) This article includes a list of general references, but it lacks sufficient corresponding inline citations. Please help to improve this article by introducing more precise citations. (November 2018) (Learn how and when to remove this message) This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Subsequence" – news · newspapers · books · scholar · JSTOR (November 2018) (Learn how and when to remove this message) (Learn how and when to remove this message)

In mathematics, a subsequence of a given sequence is a sequence that can be derived from the given sequence by deleting some or no elements without changing the order of the remaining elements. For example, the sequence ${\displaystyle \langle A,B,D\rangle }$ is a subsequence of ${\displaystyle \langle A,B,C,D,E,F\rangle }$ obtained after removal of elements ${\displaystyle C,}$ ${\displaystyle E,}$ and ${\displaystyle F.}$ The relation of one sequence being the subsequence of another is a preorder.

Subsequences can contain consecutive elements which were not consecutive in the original sequence. A subsequence which consists of a consecutive run of elements from the original sequence, such as ${\displaystyle \langle B,C,D\rangle ,}$ from ${\displaystyle \langle A,B,C,D,E,F\rangle ,}$ is a substring. The substring is a refinement of the subsequence.

The list of all subsequences for the word "apple" would be "a", "ap", "al", "ae", "app", "apl", "ape", "ale", "appl", "appe", "aple", "apple", "p", "pp", "pl", "pe", "ppl", "ppe", "ple", "pple", "l", "le", "e", "" (empty string).