Also found in: Thesaurus, Encyclopedia, Wikipedia.


 (sŭb′sĭ-kwĕns′, -kwəns)
1. Something that is subsequent; a sequel.
2. The fact or quality of being subsequent.
3. (-sē′kwəns) Mathematics A sequence that is contained in another sequence.


1. the fact or state of being subsequent
2. a subsequent incident or occurrence
3. (Mathematics) maths a sequence derived from a given sequence by selecting certain of its terms and retaining their order. Thus, <a2, a3> is a subsequence of <a1, a2, a3>, while <a3, a2> is not


(ˈsʌb sɪ kwəns)

1. the state or fact of being subsequent.
2. a subsequent occurrence, event, etc.; sequel.
ThesaurusAntonymsRelated WordsSynonymsLegend:
Noun1.subsequence - something that follows something else
final result, outcome, resultant, termination, result - something that results; "he listened for the results on the radio"
2.subsequence - following in time
lateness - quality of coming late or later in time
References in classic literature ?
A literary coincidence compounded of a discreditable priority and an honorable subsequence.
Bishop Johnstone Wandera of Dominion of Chris Ministry and Reverend Nicholas Olumasai of Kakamega Fellowship led in the prayer sessions.Taking to the press after the match, Bishop Wandera assured that, bad spell that had remained persistent in the club were over now and reiterated that the team would finish in a reasonable position with good results expected in the subsequence matches.
Note that sequences ([u.sub.n]) and ([M.sup.n] [nabla][nabla] [u.sub.n]) in the above definition are bounded in [H.sup.2.sub.0]([OMEGA]) and [L.sup.2]([OMEGA];Sym), respectively, and thus converge (on a subsequence).
The sequence [([S.sub.n]).sub.n[member of]N] is a family of analytic functions which is uniformly bounded on every compact subset of C \ R, hence by Montel's theorem there exists a subsequence [mathematical expression not reproducible] that converges uniformly on compact subsets of C \ R to an analytic function S, and also its derivatives converge uniformly on these compact subsets:
If X is a regular space and S is a virtually stable scheme having a subsequence consisting of continuous mappings, then the function r defined above is continuous and hence F(S) is a retract of C(S).
On the other hand, if [[x.sub.n] : n [member of] N} is an infinite set then there is an infinite Cauchy subsequence [mathematical expression not reproducible] of ([x.sub.n]) such that [mathematical expression not reproducible].
for some subsequence [mathematical expression not reproducible] has a supercyclic vector, then it is a supercyclic operator.
In order to find a subsequence that minimizes the distance to the reference over all possible subsequences of query, we modify the initial conditions of the classic DTW algorithm by setting d (i, 0) = [infinity] for i [member of] [0 : n] and d(0, j) = 0 for j [member of] [0 : m].
Then {[[??].sub.n]} is said to be a soft subsequence of {[[??].sub.n]} if {[[??].sub.n]([lambda])} is a subsequence of {[[??].sub.n]([lambda])} for all [lambda] [member of] A.