Results 81 to 90 of about 34,755 (248)

Tumor B‐cell infiltration in platinum‐treated advanced muscle‐invasive urothelial carcinoma

open access: yesMolecular Oncology, EarlyView.
Bladder tumors with higher pretreatment memory B‐cell infiltration were linked to longer survival after cisplatin chemotherapy, but not carboplatin. These tumors also showed more organized immune structures (tertiary lymphoid structures) and a shared pro‐inflammatory B‐cell‐rich community, suggesting that memory B cells may help identify patients most ...
Konrad Stawiski   +10 more
wiley   +1 more source

On eigenspaces of some compound signed graphs

open access: yes, 2016
In the theory of (simple) graphs the concepts of the line and subdivision graph (as compound graphs) are well-known. It is possible to consider them also in the context of (edge) signed graphs.
Sciriha, Irene   +2 more
core   +1 more source

Patient therapy outcome modeling in cancer organoids is improved by cancer‐associated fibroblasts and organoid assembly convolution

open access: yesMolecular Oncology, EarlyView.
Patient‐derived organoids (PDOs) from pancreatic, colorectal, and gastric cancers were used to evaluate standard and experimental therapies. Incorporating cancer‐associated fibroblasts (CAFs) into organoid cultures improved patient therapy outcome prediction.
Marcin Grochowski   +12 more
wiley   +1 more source

Epigenetic heterogeneity and plasticity in therapy‐induced tumor states through single‐cell multi‐omics

open access: yesMolecular Oncology, EarlyView.
Single‐cell multi‐omics reveals epigenetic heterogeneity across therapy‐adaptive tumor states, including quiescent/dormant, drug‐tolerant persister, and EMT‐like phenotypes. By linking regulatory features with state‐associated biomarkers, these approaches inform biomarker‐guided therapeutic strategies for evolving tumors.
Hee Jung Kim   +3 more
wiley   +1 more source

Some results on semi-total signed graphs

open access: yes, 2011
A signed graph (or sigraph in short) is an ordered pair $S = (S^u,σ)$, where $S^u$ is a graph G = (V,E), called the underlying graph of S and σ:E → {+, -} is a function from the edge set E of $S^u$ into the set {+,-}, called the signature of S.
Garg, Pravin, Sinha, Deepa
core   +1 more source

The role of frustration in collective decision-making dynamical processes on multiagent signed networks

open access: yes, 2022
In this article, we consider a collective decision-making process in a network of agents described by a nonlinear interconnected dynamical model with sigmoidal nonlinearities and signed interaction graph.
Fontan, Angela,   +3 more
core   +1 more source

A light‐triggered Time‐Resolved X‐ray Solution Scattering (TR‐XSS) workflow with application to protein conformational dynamics

open access: yesFEBS Open Bio, EarlyView.
Time‐resolved X‐ray solution scattering captures how proteins change shape in real time under near‐native conditions. This article presents a practical workflow for light‐triggered TR‐XSS experiments, from data collection to structural refinement. Using a calcium‐transporting membrane protein as an example, the approach can be broadly applied to study ...
Fatemeh Sabzian‐Molaei   +3 more
wiley   +1 more source

Signed Graphs Associated with the Lattice A_n [PDF]

open access: yes, 2003
For any base of the root lattice A_n, we can construct a signed graph naturally. A connected graph is called a Fushimi tree if its all blocks are complete subgraphs. In the present note, a Fushimi tree is said to be simple when by deleting any cut vertex,
1019   +5 more
core  

MiR‐513a promotes human erythroid differentiation by modulating c‐Jun

open access: yesFEBS Open Bio, EarlyView.
During early human erythropoiesis, miR‐513a promoted erythroid differentiation in primary human CD34+ hematopoietic stem‐progenitor cells and human TF‐1 erythroleukemic cells by indirectly decreasing c‐Jun and phospho‐c‐Jun expression, which are associated with increased GATA1 expression.
MinJung Kim   +11 more
wiley   +1 more source

Note on Path Signed Graphs

open access: yes, 2020
Data in the social sciences can often modeled using signed graphs, graphs where every edge has a sign + or −, or marked graphs, graphs where every vertex has a sign + or −.
Kota Reddy, M S Subramanya, P Siva
core  

Home - About - Disclaimer - Privacy