Results 111 to 120 of about 9,781,779 (300)

On the independence number of graph powers

open access: yesComputational and Applied Mathematics
Abstract Let G be a simple connected graph, and k be a positive integer. The k th graph power $$G^k$$
Rosário Fernandes, Rúben Palma
openaire   +2 more sources

Salmonella lipopolysaccharide‐containing supported lipid bilayers as platforms to study bacteriophage interactions

open access: yesFEBS Letters, EarlyView.
We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace   +6 more
wiley   +1 more source

On the Number of Successes in Independent Trials

open access: yesThe Annals of Mathematical Statistics, 1965
The distribution of the number of successes in independent trials is shown to be bell-shaped of every order. The most likely number of successes is "almost uniquely" determined from the mean number and from the mean plus the largest and smallest probability of success on any trial.
openaire   +3 more sources

From mice to humans—divergent strategies for intestinal homeostasis and regeneration

open access: yesFEBS Letters, EarlyView.
Recent advances such as organoid genome editing, xenotransplantation, imaging, and whole‐genome sequencing have enabled direct studies of human intestinal stem cells (ISCs). These studies reveal species‐specific features, including slower ISC proliferation, distinct injury responses, slower somatic mutation accumulation in humans, and an inverse ...
Keiko Ishikawa   +2 more
wiley   +1 more source

Design and analysis strategies for robust microbiome ageing research

open access: yesFEBS Letters, EarlyView.
The gut microbiome changes with age and associates with age‐related morbidity and mortality, establishing it as a potential biomarker and intervention target for ageing. Realising this potential requires methodological rigour, yet distinguishing biological signals from methodological artefacts remains challenging across cohorts. This review provides an
Mark Olenik   +5 more
wiley   +1 more source

ABL kinase‐dependent phosphorylation of SH proteins promotes their direct interaction with CRK family SH2 domains

open access: yesFEBS Letters, EarlyView.
CT10 regulator of kinase (CRK) and CRK‐Like (CRKL) are signaling adaptors driving cell adhesion, motility, differentiation, and proliferation. SH2‐domain containing (SH) proteins are enriched in YXXP motifs which when phosphorylated create preferred binding sites for CRK family SH2 domains.
Phoebe M. Cousens   +8 more
wiley   +1 more source

On the Independence Number of Edge Chromatic Critical Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2014
In 1968, Vizing conjectured that for any edge chromatic critical graph G = (V,E) with maximum degree △ and independence number α (G), α (G) ≤. It is known that α (G) < |V |. In this paper we improve this bound when △≥ 4.
Pang Shiyou   +3 more
doaj   +1 more source

Reconstructing enzyme evolution by protein engineering

open access: yesFEBS Letters, EarlyView.
Natural enzyme evolution can be retraced by protein engineering methods such as directed evolution, rational design, and ancestral sequence reconstruction. These approaches reveal how enzymes emerged from ligand‐binding scaffolds, developed varying substrate preferences, formed oligomeric complexes, adapted to environmental changes, and evolved novel ...
Lukas Drexler   +2 more
wiley   +1 more source

Explaining de facto judicial independence [PDF]

open access: yes
Judicial Independence (JI) as factually implemented varies considerably between countries. Since de iure JI is an imperfect predictor of de facto JI, a number of variables that might determine the factual level of judicial independence is theoretically ...
Bernd Hayo, Stefan Voigt
core  

New Formulae for the Decycling Number of Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2019
A set S of vertices of a graph G is called a decycling set if G−S is acyclic. The minimum order of a decycling set is called the decycling number of G, and denoted by ∇(G). Our results include: (a) For any graph G,, where T is taken over all the spanning
Yang Chao, Ren Han
doaj   +1 more source

Home - About - Disclaimer - Privacy