Results 61 to 70 of about 43,554 (293)
Tau acetylation at K331 has limited impact on tau pathology in vivo
We mapped tau post‐translational modifications in humanized MAPT knock‐in mice and in amyloid‐bearing double knock‐in mice. Acetylation within the repeat domain, particularly around K331, showed modest increases under amyloid pathology. To test functional relevance, we generated MAPTK331Q knock‐in mice.
Shoko Hashimoto +3 more
wiley +1 more source
Total 2-Rainbow Domination Numbers of Trees
A 2-rainbow dominating function (2RDF) of a graph G = (V (G), E(G)) is a function f from the vertex set V (G) to the set of all subsets of the set {1, 2} such that for every vertex v ∈ V (G) with f(v) = ∅ the condition ∪u∈N(v)f(u) = {1, 2} is fulfilled ...
Ahangar H. Abdollahzadeh +4 more
doaj +1 more source
Total dominator color class total dominating sets in ladder and mobius ladder graph
Let $G$ be a finite, undirected and connected graph with minimum degree at least one. A proper coloring $\mathcal{C}$ of $G$ is said to be a total dominator color class total dominating set of $G$ if each vertex properly dominates a color class in $\mathcal{C}$ and each color class in $\mathcal{C}$ is properly dominated by a vertex in $\mathrm{V ...
null A. Vijayalekshmi, null S. Abisha
openaire +1 more source
Total Roman {2}-Dominating Functions in Graphs
A Roman {2}-dominating function (R2F) is a function f : V → {0, 1, 2} with the property that for every vertex v ∈ V with f(v) = 0 there is a neighbor u of v with f(u) = 2, or there are two neighbors x, y of v with f(x) = f(y) = 1.
Chellali, M. +3 more
core +1 more source
Calpain small subunit homodimerization is robust and calcium‐independent
Calpains dimerize via penta‐EF‐hand (PEF) domains. Using single‐molecule force spectroscopy, we measured the strength and kinetics of PEF–PEF homodimer binding. The interaction is robust, shows a transient conformational step before dissociation, and remains largely insensitive to Ca2+.
Nesha May O. Andoy +4 more
wiley +1 more source
NP-completeness Results for Partitioning a Graph into Total Dominating Sets [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mikko Koivisto +2 more
openaire +3 more sources
On resolving total dominating set of sunlet graphs
Abstract The set D ⊆ V(G) is called dominating set on graph G so that every vertex not in D is adjacent to at least one vertex in D. The set Dt ⊆ V(G) is called total dominating set on graph G so that the vertex in Dt are neighboring at least one dot in Dt . The smallest cardinality
R S R Ervani +4 more
openaire +1 more source
Gut microbiome and aging—A dynamic interplay of microbes, metabolites, and the immune system
Age‐dependent shifts in microbial communities engender shifts in microbial metabolite profiles. These in turn drive shifts in barrier surface permeability of the gut and brain and induce immune activation. When paired with preexisting age‐related chronic inflammation this increases the risk of neuroinflammation and neurodegenerative diseases.
Aaron Mehl, Eran Blacher
wiley +1 more source
Total Domination Versus Paired-Domination in Regular Graphs
A subset S of vertices of a graph G is a dominating set of G if every vertex not in S has a neighbor in S, while S is a total dominating set of G if every vertex has a neighbor in S. If S is a dominating set with the additional property that the subgraph
Cyman Joanna +4 more
doaj +1 more source
Diversity and complexity in neural organoids
Neural organoid research aims to expand genetic diversity on one side and increase tissue complexity on the other. Chimeroids integrate multiple donor genomes within single organoids. Self‐organising multi‐identity organoids, exogenous cell seeding, or enforced assembly of region‐specific organoids contribute to tissue complexity.
Ilaria Chiaradia, Madeline A. Lancaster
wiley +1 more source

