「subsequence」の共起表現(1語右で並び替え)

iterative Viterbi decoding one can find the subsequence of an observation that matches best (on ave

t ask for the minimum value in a contiguous subsequence of the original sequence.

a sequence u into a sequence v by finding a subsequence of v that has the same length as u and that

y colored by the greedy algorithm using the subsequence of π induced by the vertices of the subgrap

are in error and there exists no contiguous subsequence of m correctly received symbols within the

Not to be confused with longest common subsequence problem.

gorithm is a solution to the longest common subsequence problem.

uld not be confused with the longest common subsequence problem.

of the difference between a substring and a subsequence, see Substring vs. subsequence).

「subsequence」の共起表現一覧(1語右で並び替え)