- subsequences
- Последовтельности
Большой англо-русский и русско-английский словарь. 2001.
Большой англо-русский и русско-английский словарь. 2001.
Longest common subsequence problem — Not to be confused with longest common substring problem. The longest common subsequence (LCS) problem is to find the longest subsequence common to all sequences in a set of sequences (often just two). Note that subsequence is different from a… … Wikipedia
Longest increasing subsequence — The longest increasing subsequence problem is to find a subsequence of a given sequence in which the subsequence elements are in sorted order, lowest to highest, and in which the subsequence is as long as possible. This subsequence is not… … Wikipedia
Apollo Guidance Computer — and DSKY Invented by MIT Instrumentation Laboratory Manufacturer Raytheon Introduced August 1966 … Wikipedia
CYK algorithm — The Cocke–Younger–Kasami (CYK) algorithm (alternatively called CKY) is a parsing algorithm for context free grammars. It employs bottom up parsing and dynamic programming. The standard version of CYK operates only on context free grammars given… … Wikipedia
Subsequence — In mathematics, a subsequence of some sequence is a new sequence which is formed from the original sequence by deleting some of the elements without disturbing the relative positions of the remaining elements. Formally, suppose that X is a set… … Wikipedia
Patience sorting — is a sorting algorithm, based on a solitaire card game, that has the property of being able to efficiently compute the length of the longest increasing subsequence in a given array.The card gameThe game begins with a shuffled deck of cards,… … Wikipedia
Erdős–Szekeres theorem — In mathematics, the Erdős–Szekeres theorem is a finitary result, which makes precise one of the corollaries of Ramsey s theorem. While Ramsey s theorem makes it easy to prove that any sequence of distinct real numbers contains either a… … Wikipedia
Subnet (mathematics) — In topology and related areas of mathematics, a subnet is a generalization of the concept of subsequence to the case of nets. The definition is not completely straightforward, but is designed to allow as many theorems about subsequences to… … Wikipedia
Central limit theorem — This figure demonstrates the central limit theorem. The sample means are generated using a random number generator, which draws numbers between 1 and 100 from a uniform probability distribution. It illustrates that increasing sample sizes result… … Wikipedia
Limit superior and limit inferior — In mathematics, the limit inferior (also called infimum limit, liminf, inferior limit, lower limit, or inner limit) and limit superior (also called supremum limit, limsup, superior limit, upper limit, or outer limit) of a sequence can be thought… … Wikipedia
BLAST — Infobox Software name=BLAST developer=Myers, E., Altschul S.F., Gish W., Miller E.W., Lipman D.J., NCBI latest release version=2.2.18 operating system=UNIX, Linux, Mac, MS Windows genre=Bioinformatics tool license=Public Domain website=… … Wikipedia