The proteins encoded by the A56R and K2L genes of vaccinia virus form a heterodimer (A56/K2) and have a fusion regulatory role as deletion or mutation of either causes infected cells to form large syncytia spontaneously. Here, we showed that syncytia formation is dependent on proteins of the recently described entry fusion complex (EFC), which are also required for virus-cell fusion and low-pH-...

We elucidate constraints imposed by confinement and dynamical chiral symmetry breaking on the infrared behaviour of the dressed-quark and -gluon propagators, and dressed-quark-gluon vertex. In covariant gauges the dressing of the gluon propagator is completely specified by P(k2) := 1/[1+Π(k2)], where Π(k2) is the vacuum polarisation. In the absence of particle-like singularities in the dressed-...

Reduced levels of kindlin-2 (K2) in endothelial cells derived from K2(+/-)mice or C2C12 myoblastoid cells treated with K2 siRNA showed disorganization of their actin cytoskeleton and decreased spreading. These marked changes led us to examine direct binding between K2 and actin. Purified K2 interacts with F-actin in cosedimentation and surface plasmon resonance analyses and induces actin aggreg...

In a recent work, the combinatorial interpretation of the polynomial α(n; k1, k2, . . . , kn) counting the number of Monotone Triangles with bottom row k1 < k2 < · · · < kn was extended to weakly decreasing sequences k1 ≥ k2 ≥ · · · ≥ kn. In this case the evaluation of the polynomial is equal to a signed enumeration of objects called Decreasing Monotone Triangles. In this paper we define Genera...

We construct a rigid analytical regulator for the K2 of Mumford curves, a non-archimedean analogue of the complex analytical Beilinson-Bloch-Deligne regulator.

A Bayesian network is an appropriate tool to deal with the uncertainty that is typical of real-life applications. Bayesian network arcs represent statistical dependence between different variables. In the data mining field, association and correlation rules can be interpreted as well as expressing statistical dependence relations. K2 is a well-known algorithm which is able to learn Bayesian net...

A (δ ≥ k1, δ ≥ k2)-partition of a graph G is a vertex-partition (V1, V2) of G satisfying that δ(G[Vi]) ≥ ki for i = 1, 2. We determine, for all positive integers k1, k2, the complexity of deciding whether a given graph has a (δ ≥ k1, δ ≥ k2)-partition. We also address the problem of finding a function g(k1, k2) such that the (δ ≥ k1, δ ≥ k2)-partition problem is NP-complete for the class of gra...