Results 81 to 90 of about 366,581 (319)
Total domination numbers of cartesian products [PDF]
, 2004 Let G□H denote the cartesian product of graphs G and H.
A. Klobučar
core +1 more source
FEBS Letters, EarlyView.This perspective highlights emerging insights into how the circadian transcription factor CLOCK:BMAL1 regulates chromatin architecture, cooperates with other transcription factors, and coordinates enhancer dynamics. We propose an updated framework for how circadian transcription factors operate within dynamic and multifactorial chromatin landscapes ...
Xinyu Y. Nie, Jerome S. Menet
wiley +1 more source
The complexity of connected domination and total domination by restricted induced graphs [PDF]
, 2010 Given a graph class C, it is natural to ask whether a given graph has a connected or a total dominating set inducing a graph of C and, if so, what is the minimal size of such a set.
Schaudt, Oliver, Schrader, Rainer
core
Real‐time assay of ribonucleotide reductase activity with a fluorescent RNA aptamer
FEBS Letters, EarlyView.Ribonucleotide reductases (RNR) synthesize DNA building blocks de novo, making them crucial in DNA replication and drug targeting. FLARE introduces the first single‐tube real‐time coupled RNR assay, which enables isothermal tracking of RNR activity at nanomolar enzyme levels and allows the reconstruction of allosteric regulatory patterns and rapid ...
Jacopo De Capitani +4 more
wiley +1 more source
Disordered but rhythmic—the role of intrinsic protein disorder in eukaryotic circadian timing
FEBS Letters, EarlyView.Unstructured domains known as intrinsically disordered regions (IDRs) are present in nearly every part of the eukaryotic core circadian oscillator. IDRs enable many diverse inter‐ and intramolecular interactions that support clock function. IDR conformations are highly tunable by post‐translational modifications and environmental conditions, which ...
Emery T. Usher, Jacqueline F. Pelham
wiley +1 more source
Himpunan Dominasi Ganda Pada Graf Korona Dan Graf Produk Leksikografi Dua Buah Graf [PDF]
, 2016 ABSTARCT. Let be a subset of , with is a graph without isolated vertices. A subset of referred to double domination in if every vertex , such that every vertex in minimal adjacent with two element of .
Maulana, F. (Fikri)
core
Protein pyrophosphorylation by inositol pyrophosphates — detection, function, and regulation
FEBS Letters, EarlyView.Protein pyrophosphorylation is an unusual signaling mechanism that was discovered two decades ago. It can be driven by inositol pyrophosphate messengers and influences various cellular processes. Herein, we summarize the research progress and challenges of this field, covering pathways found to be regulated by this posttranslational modification as ...
Sarah Lampe +3 more
wiley +1 more source
Domination Parameters of a Graph and its Complement
Discussiones Mathematicae Graph Theory, 2018 A dominating set in a graph G is a set S of vertices such that every vertex in V (G) \ S is adjacent to at least one vertex in S, and the domination number of G is the minimum cardinality of a dominating set of G.
Desormeaux Wyatt J. +2 more
doaj +1 more source
The role of histone modifications in transcription regulation upon DNA damage
FEBS Letters, EarlyView.This review discusses the critical role of histone modifications in regulating gene expression during the DNA damage response (DDR). By modulating chromatin structure and recruiting repair factors, these post‐translational modifications fine‐tune transcriptional programmes to maintain genomic stability.
Angelina Job Kolady, Siyao Wang
wiley +1 more source
The Algorithmic Complexity of Bondage and Reinforcement Problems in bipartite graphs [PDF]
, 2014 Let $G=(V,E)$ be a graph. A subset $D\subseteq V$ is a dominating set if every vertex not in $D$ is adjacent to a vertex in $D$. The domination number of $G$, denoted by $\gamma(G)$, is the smallest cardinality of a dominating set of $G$.
Hu, Fu-Tao, Sohn, Moo Young
core