Results 51 to 60 of about 269,190 (213)
Intein‐based modular chimeric antigen receptor platform for specific CD19/CD20 co‐targeting
Molecular Oncology, EarlyView.CARtein is a modular CAR platform that uses split inteins to splice antigen‐recognition modules onto a universal signaling backbone, enabling precise, scarless assembly without re‐engineering signaling domains. Deployed here against CD19 and CD20 in B‐cell malignancies, the design supports flexible multi‐antigen targeting to boost T‐cell activation and
Pablo Gonzalez‐Garcia +9 more
wiley +1 more source
On the strong metric dimension of sun graph, windmill graph, and möbius ladder graph
, 2018 Let G be a connected graph with vertex set V(G) and edge set E(G). The interval I[u, v] between u and v is defined as the collection of all vertices that belong to some shortest u-v path.
Mila Widyaningrum, Tri Atmojo Kusmayadi
semanticscholar +1 more source
Metric Dimension of Amalgamation of Graphs [PDF]
, 2013 A set of vertices $S$ resolves a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The metric dimension of $G$ is the minimum cardinality of a resolving set of $G$.
Saputro, Suhadi Wido +2 more
core
Molecular Oncology, EarlyView.HDAC4 is degraded by the E3 ligase FBXW7. In colorectal cancer, FBXW7 mutations prevent HDAC4 degradation, leading to oxaliplatin resistance. Forced degradation of HDAC4 using a PROTAC compound restores drug sensitivity by resetting the super‐enhancer landscape, reprogramming the epigenetic state of FBXW7‐mutated cells to resemble oxaliplatin ...
Vanessa Tolotto +13 more
wiley +1 more source
On the strong metric dimension of antiprism graph, king graph, and K m ⊙ K n graph
, 2018 Let G be a connected graph with a set of vertices V(G) and a set of edges E(G). The interval I[u, v] between u and v to be the collection of all vertices that belong to some shortest u-v path.
Yuyun Mintarsih, Tri Atmojo Kusmayadi
semanticscholar +1 more source
Cerulean: A hybrid assembly using high throughput short and long reads
, 2013 Genome assembly using high throughput data with short reads, arguably, remains an unresolvable task in repetitive genomes, since when the length of a repeat exceeds the read length, it becomes difficult to unambiguously connect the flanking regions.
D.R. Zerbino +14 more
core +1 more source
Molecular Oncology, EarlyView.Development of therapies targeting cancer‐associated fibroblasts (CAFs) necessitates preclinical model systems that faithfully represent CAF–tumor biology. We established an in vitro coculture system of patient‐derived pancreatic CAFs and tumor cell lines and demonstrated its recapitulation of primary CAF–tumor biology with single‐cell transcriptomics ...
Elysia Saputra +10 more
wiley +1 more source
, 2018 Let G be a connected graph with vertex set V(G) and edge set E(G). For every pair of vertices u , v ∈ V ( G ) , the interval I[u, v] between u and v to be the collection of all vertices that belong to some shortest u − v path.
Ratih Yunia Mayasari +1 more
semanticscholar +1 more source
Dual targeting of RET and SRC synergizes in RET fusion‐positive cancer cells
Molecular Oncology, EarlyView.Despite the strong activity of selective RET tyrosine kinase inhibitors (TKIs), resistance of RET fusion‐positive (RET+) lung cancer and thyroid cancer frequently occurs and is mainly driven by RET‐independent bypass mechanisms. Son et al. show that SRC TKIs significantly inhibit PAK and AKT survival signaling and enhance the efficacy of RET TKIs in ...
Juhyeon Son +13 more
wiley +1 more source
Strong Resolving Graphs of Clean Graphs of Commutative Rings
Let $R$ be a ring with unity. The clean graph $\text{Cl}(R)$ of a ring $R$ is the simple undirected graph whose vertices are of the form $(e,u)$, where $e$ is an idempotent element and $u$ is a unit of the ring $R$ and two vertices $(e,u)$, $(f,v)$ of $\text{Cl}(R)$ are adjacent if and only if $ef = fe =0$ or $uv = vu=1$.
Mathil, Praveen, Kumar, Jitender
openaire +2 more sources