Results 101 to 110 of about 641,798 (254)
Object Phobia and Altered RhoA Signaling in Amygdala of Mice Lacking RICH2
RICH2 knockout (RICH2 KO) mice exhibit neophobia in the novel object test. To gain further insight into their anxiety-related phenotype, we subjected these mice to additional behavioral tests to elucidate whether the behavioral abnormality in these mice ...
Tasnuva Sarowar +4 more
doaj +1 more source
Reprogramming tumor cells with LCOR mRNA nanotherapy to enhance immunotherapy
LCOR (Ligand‐dependent corepressor) mRNA encapsulated in polymeric nanoparticles restores LCOR activity in tumor cells, constraining aggressive tumor cell states and increasing tumor immunogenicity. This reprogramming makes tumor cells more vulnerable to T‐cell attack and enhances their response to immune‐checkpoint immunotherapy.
Gabriel Serra‐Mir +9 more
wiley +1 more source
Prime Labelings of Snake Graphs [PDF]
A prime labeling of a graph G with n vertices is a labeling of the vertices with distinct integers from the set {1, 2 ,..., n} such that the labels of any two adjacent vertices are relatively prime.
Turley, Jordan +4 more
core +1 more source
Engineering IL‐4 resistant proinflammatory human myeloid cells for cancer immunotherapy
We developed a scalable workflow to generate proinflammatory human myeloid cells. CRISPR/Cas9‐edited CD34+ hematopoietic stem and progenitor cells were expanded and differentiated with M‐CSF. Deletion of STAT6 or STAT6/NFKB1 enhanced macrophage proinflammatory gene expression and cytokine secretion in the presence of IL‐4 while maintaining antibody ...
Theresa Barberi, Alan D. Friedman
wiley +1 more source
Some results on SD-Prime cordial labeling
Given a bijection ʄ : V(G) → {1,2, …,|V(G)|}, we associate 2 integers S = ʄ(u)+ʄ(v) and D = |ʄ(u)-ʄ(v)| with every edge uv in E(G). The labeling ʄ induces an edge labeling ʄ'' : E(G) → {0,1} such that for any edge uv in E(G), ʄ '(uv)=1 if gcd(S,D)=1, and
Lourdusamy, A., Patrick, F.
core +1 more source
Prime Cordial Labeling on Graphs
A prime cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2, ..., |V |} such that each edge uv is assigned the label 1 if gcd(f(u), f(v)) = 1 and 0 if gcd(f(u), f(v)) > 1, then the number of edges labeled with 0 and the ...
J. Baskar Babujee, S. Babitha
core +1 more source
Single‐molecule DNA flow‐stretch assays for high‐throughput DNA–protein interaction studies
We describe an optimised single‐molecule DNA flow‐stretch assay that visualises DNA–protein interactions in real time. Linear DNA fragments are tethered to a surface and stretched by buffer flow for fluorescence imaging. Using λ and φX174 DNA, this protocol enhances reproducibility and accessibility, providing a versatile approach for studying diverse ...
Ayush Kumar Ganguli +8 more
wiley +1 more source
Prime Labeling Graphs and Hypergraphs
Graph labeling problems date back to the beginning of Graph Theory itself (see the Four Color Theorem). Roughly 40 years ago, the notion of a prime labeling of a graph was introduced; a graph on n vertices has a prime labeling if its vertices can be ...
Way, Alan, McCullough, Justin
core
Directed evolution of enzymes at the crossroads of tradition and innovation
An iterative cycle of data‐driven enzyme optimization comprising four stages: genetic diversification of a template enzyme, expression of protein variants, high‐throughput evaluation, and machine‐learning‐guided redesign of the next variant library.
Maria Tomkova +2 more
wiley +1 more source
Small RNA pathways in mammalian oocytes
Three distinct small RNA pathways operate in mammalian oocytes: RNAi interference (RNAi), the microRNA (miRNA) pathway, and the PIWI‐associated RNA (piRNA) pathway. These pathways use small RNAs to guide sequence‐specific repression and contribute to oocyte biology by targeting genes and mobile elements or appear insignificant since different ...
Petr Svoboda, Josef Pasulka
wiley +1 more source

