- circular permutation
- мат. круговая [циклическая] перестановка
Большой англо-русский и русско-английский словарь. 2001.
circular permutation
Смотреть что такое "circular permutation" в других словарях:
Circular permutation in proteins — Circular permutation is a process during evolution that changes the order of amino acids in a protein sequence, resulting in a protein structure with different connectivity, but overall similar three dimensional shape. As a consequence of the… … Wikipedia
Circular — is a basic geometric shape such as a Circle. Contents 1 Documents 2 Travel and transportation 3 Places … Wikipedia
Circular shift — In combinatorial mathematics, a circular shift is the operation of rearranging the entries in a tuple, either by moving the final entry to the first position, while shifting all other entries to the next position, or by performing the inverse… … Wikipedia
Cyclic permutation — A cyclic permutation or circular permutation is a permutation built from one or more sets of elements in cyclic order. The notion cyclic permutation is used in different, but related ways: Contents 1 Definition 1 2 Definition 2 3 Definition 3 … Wikipedia
List of permutation topics — This is a list of topics on mathematical permutations.*Alternating group *Alternating permutation *Bijection *Circular shift *Combination *Cycle index *Cycle notation *Cyclic order *Cyclic permutation *Derangement *Even and odd permutations… … Wikipedia
Cycle notation — For the cyclic decomposition of graphs, see Cycle decomposition (graph theory). For cycling terminology, see glossary of bicycling. In combinatorial mathematics, the cycle notation is a useful convention for writing down a permutation in terms of … Wikipedia
Rotation system — In combinatorial mathematics, rotation systems encode embeddings of graphs onto orientable surfaces, by describing the circular ordering of a graph s edges around each vertex.A more formal definition of a rotation system involves pairs of… … Wikipedia
Cycle rank — In graph theory, the cycle rank of a directed graph is a digraph connectivity measure proposed first by Eggan and Büchi (Eggan 1963). Intuitively, this concept measures how close a digraph is to a directed acyclic graph (DAG), in the sense that a … Wikipedia
PQ tree — A PQ tree is a tree based data structure that represents a family of permutations on a set of elements, discovered and named by Kellogg S. Booth and George S. Lueker in 1976. It is a rooted, labeled tree, in which each element is represented by… … Wikipedia
Cyclic order — In mathematics, a cyclic order is a way to arrange a set of objects in a circle.[nb] Unlike most structures in order theory, a cyclic order cannot be modeled as a binary relation a < b . One does not say that east is more clockwise than west.… … Wikipedia
Uniform distribution (discrete) — discrete uniform Probability mass function n = 5 where n = b − a + 1 Cumulative distribution function … Wikipedia
