Results 81 to 90 of about 4,363,442 (260)
On The Independence Number Of Some Strong Products Of Cycle-Powers
Foundations of Computing and Decision Sciences, 2015 In the paper we give some theoretical and computational results on the third strong power of cycle-powers, for example, we have found the independence numbers α((C102)√3) = 30 and α((C144)√3) = 14.
Jurkiewicz Marcin +2 more
doaj +1 more source
Independent strong domination in complementary prisms
Electronic Journal of Graph Theory and Applications, 2020 Let G = (V, E) be a graph and u,v ∈ V. Then, u strongly dominates v if (i) uv ∈ E and (ii) deg(u) ≥ deg(v). A set D ⊂ V is a strong-dominating set of G if every vertex in V-D is strongly dominated by at least one vertex in D.
Zeynep Nihan Berberler +1 more
doaj +1 more source
Peptide‐based ligand antagonists block a Vibrio cholerae adhesin
FEBS Letters, EarlyView.The structure of a peptide‐binding domain of the Vibrio cholerae adhesin FrhA was solved by X‐ray crystallography, revealing how the inhibitory peptide AGYTD binds tightly at its Ca2+‐coordinated pocket. Structure‐guided design incorporating D‐amino acids enhanced binding affinity, providing a foundation for developing anti‐adhesion therapeutics ...
Mingyu Wang +9 more
wiley +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 conversion of L-histidine to glutamic acid by liver enzymes [PDF]
, 1952 Edlbacher and Neber (1) showed in 1934 that the liver enzyme named histidase degrades histidine to NH3, formic acid, and an unknown product which on further treatment with strong alkali yields glutamic acid.
Abrams, Adolph, Borsook, Henry
core
The Product of Strong Operator Measurable Functions is Strong Operator Measurable [PDF]
Proceedings of the American Mathematical Society, 1993 Let \(H\) be a separable complex Hilbert space, \({\mathcal L}(H)\) be the space of all bounded \(H\)-valued linear operators on \(H\), and let \((X,{\mathcal S},\mu)\) be a complete, finite measure space. A function \(f: X\to {\mathcal L}(H)\) is said to be strong operator measurable if \(f(\cdot)h: X\to H\) is strongly measurable for every \(h\in H\).
openaire +1 more source
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
The geodetic domination number for the product of graphs [PDF]
Transactions on Combinatorics, 2014 A subset S of vertices in a graph G is called a geodetic set if every vertex not in S lies on a shortest path between two vertices from S. A subset D of vertices in G is called dominating set if every vertex not in D has at least one neighbor in D.
S. Robinson Chellathurai +1 more
doaj
FEBS Letters, EarlyView.Multidrug transporters BpeB and BpeF from the Gram‐negative pathogen Burkholderia pseudomallei have a hydrophilic patch in their substrate‐binding pocket. Drug susceptibility tests and growth curve analyses using an Escherichia coli recombinant expression system revealed that the hydrophilic patches of BpeB and BpeF are involved in the substrate ...
Ui Okada, Satoshi Murakami
wiley +1 more source
Closed Formulae for the Strong Metric Dimension of Lexicographic Product Graphs
Discussiones Mathematicae Graph Theory, 2016 Given a connected graph G, a vertex w ∈ V (G) strongly resolves two vertices u, v ∈ V (G) if there exists some shortest u − w path containing v or some shortest v − w path containing u. A set S of vertices is a strong metric generator for G if every pair
Kuziak Dorota +2 more
doaj +1 more source