Three-dimensional structures of protein backbones have been predicted using neural networks. A feed forward neural network was trained on a class of functionally, but not structurally, homologous proteins, using backpropagation learning. The network generated tertiary structure information in the form of binary distance constraints for the C(alpha) atoms in the protein backbone. The binary dist...

The QCD radiative corrections to the leptonic decay rate of the B c meson are calculated using the formalism of nonrelativistic QCD (NRQCD) to separate short-distance and long-distance effects. The B c decay constant is factored into a sum of NRQCD matrix elements each multiplied by a short-distance coefficient. The short-distance coefficient for the leading matrix element is calculated to orde...

The Sn(IV) atom in the title compound, [Sn(C(6)H(5))(3)Cl(C(13)H(12)OS)], is situated within a distorted C(3)ClO trigonal-bipyramidal coordination geometry with a mean Sn-C distance of 2.136 (6) Å and with an Sn-O distance of 2.393 (4) Å. The Sn(IV) atom lies 0.171 (3) Å out of the equatorial C(3) plane in the direction of the axially bound Cl atom.

In the paper notation from [1] is used. A binary symmetric channel (BSC) with crossover probability 0 < p < 1/2 and q = 1 − p is considered. Let F n denote the set of all 2 binary n-tuples, and d(x,y), x,y ∈ F n denote the Hamming distance between x and y. A subset C = C(M,n) = {x1, . . . ,xM} ⊆ F n is called a code of length n and cardinality M . The minimum distance of the code C is d(C) = mi...

Consider the symmetric group Sn with the Hamming metric. A permutation code on n symbols is a subset C ⊆ Sn. If C has minimum distance > n − 1, then |C| 6 n2 − n. Equality can be reached if and only if a projective plane of order n exists. Call C embeddable if it is contained in a permutation code of minimum distance n−1 and cardinality n2−n. Let δ = δ(C) = n2−n−|C| be the deficiency of the per...

Given a subset C in a metric space E, its successor is the subset s(C) of points at maximum distance from C in E. We study some properties of the sequence obtained by iterating this operation. Graphs with their usual distance provide already typical examples.

A finite automaton .d with a distance function d is a sextuple, (C, Q, M, S, F, d), such that C is the input alphabet, Q is the finite set of states, M: Q x C -+ 2Q is the transition function, S c Q and F c Q are the sets of initial and final states, respectively, d: Q x C x Q -+ (0, 1, co } is the distance function, where co denotes infinity, and d satisfies the following: for any (q,a,q’)E Q ...

A parity-check matrix for a q -ary repeated-root cyclic code is derived using the Hasse derivative. Then the min imum distance of a q-ary repeated-root cyclic code C is expressecin terms of the min imum distance of a certain simple-root cyclic code C that is determined by C. With the help of this result, several binary repeated-root cyclic codes of lengths up to n = 62 are shown to contain the ...

A code in a graph 0 is a non-empty subset C of the vertex set V of 0. Given C , the partition of V according to the distance of the vertices away from C is called the distance partition of C . A completely regular code is a code whose distance partition has a certain regularity property. A special class of completely regular codes are the completely transitive codes. These are completely regula...

The 1,3-benzodioxole ring systems in the title compound, C(22)H(22)O(8), are almost planar. The perhydro-furofuranyl system linking them adopts a distorted double-envelope conformation. Supra-molecular aggregation is effected by C-H⋯O, C-H⋯π and π-π [centroid-centroid distance of 3.755 Å, inter-planar distance of 3.633 Å and dihedral angle of 14.6°] inter-actions.