Results 71 to 80 of about 53,392 (268)

Calpain small subunit homodimerization is robust and calcium‐independent

open access: yesFEBS Letters, EarlyView.
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

Chemical Reaction Optimization for Minimum Weight Dominating Set

open access: yesApplied Computational Intelligence and Soft Computing, 2023
Dominating set of a graph can be defined as the set of vertices that can cover all other vertices of the graph. The minimum weight dominating set (MWDS) is the minimum number of vertices in the dominating set with minimum total weight.
A. Pritam Khan Boni   +1 more
doaj   +1 more source

Gut microbiome and aging—A dynamic interplay of microbes, metabolites, and the immune system

open access: yesFEBS Letters, EarlyView.
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

Independent point-set dominating sets in graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2020
In this paper, we study graphs which possess an independent point-set dominating set (in short, ipsd-set). We call such a graph as an ipsd-graph. We first provide general structural characterization of separable ipsd-graphs and thereafter, in our quest ...
Purnima Gupta, Alka Goyal, Ranjana Jain
doaj   +1 more source

A Linear Kernel for Planar Total Dominating Set [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2018
A total dominating set of a graph $G=(V,E)$ is a subset $D \subseteq V$ such that every vertex in $V$ is adjacent to some vertex in $D$. Finding a total dominating set of minimum size is NP-hard on planar graphs and W[2]-complete on general graphs when ...
Valentin Garnero, Ignasi Sau
doaj   +1 more source

Partitioning a graph into a dominating set, a total dominating set, and something else [PDF]

open access: yesDiscussiones Mathematicae Graph Theory, 2010
A recent result of Henning and Southey (A note on graphs with disjoint dominating and total dominating set, {\it Ars Comb.} {\bf 89} (2008), 159--162) implies that every connected graph of minimum degree at least three has a dominating set $D$ and a total dominating set $T$ which are disjoint.
Michael A. Henning   +2 more
openaire   +1 more source

Diversity and complexity in neural organoids

open access: yesFEBS Letters, EarlyView.
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

Dominating sets in triangulations on surfaces

open access: yesArs Mathematica Contemporanea, 2011
A dominating set D of a graph G is a set such that each vertex v of G is either in the set or adjacent to a vertex in the set. Matheson and Tarjan (1996) proved that any n-vertex plane triangulation has a dominating set of size at most n/3, and conjectured a bound of n/4 for n sufficiently large.
Hong Liu, Michael J. Pelsmajer
openaire   +3 more sources

Epigenetic blind spots – the role of DNA methylation dynamics in stem cell‐based models of embryogenesis

open access: yesFEBS Letters, EarlyView.
Embryo‐like structures (stembryos) are an innovative tool, but they are hindered by experimental variability and limited developmental potential. DNA methylation is crucial for mammalian development, but its status in stembryo models is poorly characterized.
Sara Canil   +4 more
wiley   +1 more source

Dominating Sets in Planar Graphs

open access: yesEuropean Journal of Combinatorics, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lesley R. Matheson, Robert Endre Tarjan
openaire   +1 more source

Home - About - Disclaimer - Privacy