نتایج جستجو برای: k2

تعداد نتایج: 5516  

2016
Kamila Bledzka Katarzyna Bialkowska Khalid Sossey-Alaoui Julia Vaynberg Elzbieta Pluskota Jun Qin Edward F. Plow

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...

2013
Lukas Riegler

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...

2010
Ambrus Pál AMBRUS PÁL

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

2004
Evelina Lamma Fabrizio Riguzzi Sergio Storari

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...

Journal: :CoRR 2018
Jørgen Bang-Jensen Stéphane Bessy

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...

2010
Thomas Zaslavsky

Mrvar and Doreian recently defined a notion of bipartite clustering in bipartite signed graphs that gives a measure of imbalance of the signed graph, different from previous measures (the “frustration index” or “line index of balance”, l, and Davis’s clusterability). A biclustering of a bipartite signed graph is a pair (π1, π2) of partitions of the two color classes; the sets of the partitions ...

Journal: :Nucleic acids research 1988
M. Tommasino S. Ricci C. L. Galeotti

We have determined the entire sequence of the plasmid K2 from Kluyveromyces lactis which is involved in the maintenance of both killer plasmids in the cell. K2 shares many of the characteristics of the smaller killer plasmid K1: high A+T content (74.7%) and very compact genomic organization. K2 contains ten open reading frames. Some of them overlap on different strands and some on the same stra...

Journal: :Pharmacological reports : PR 2011
Janusz Szemraj Agnieszka Zakrzeska George Brown Adrian Stankiewicz Anna Gromotowicz Tomasz Grędziński Ewa Chabielska

SAK-RGD-K2-Hir and SAK-RGD-K2-Hirul are recombinant proteins that are derivatives of r-SAK (recombinant staphylokinase). They are characterized by their fibrin-specific plasminogen activation properties and their antithrombin and antiplatelet activities. The difference between these proteins is the presence of the antithrombotic fragment (hirudin or hirulog) in the C-terminal portion of the r-S...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید