Results 41 to 50 of about 999 (266)

Interferon beta drives therapy resistance in a patient‐derived model of high‐grade serous ovarian cancer

open access: yesMolecular Oncology, EarlyView.
Interferon type 1 (IFN‐1) production and signaling is associated with the acquisition of therapy resistance, following chronic DNA damage, via Interferon‐related DNA damage resistance signature (IRDS) gene expression. An alternative, DNA damage‐independent role of sustained IFN‐1 mediated resistance was identified and characterized by the emergence of ...
Ashlyn Conant   +11 more
wiley   +1 more source

Some Bond Incident Degree Indices of (Molecular) Graphs with Fixed Order and Number of Cut Vertices

open access: yesDiscrete Dynamics in Nature and Society, 2021
A bond incident degree (BID) index of a graph G is defined as ∑uv∈EGfdGu,dGv, where dGw denotes the degree of a vertex w of G, EG is the edge set of G, and f is a real-valued symmetric function. The choice fdGu,dGv=adGu+adGv in the aforementioned formula
Abeer M. Albalahi   +3 more
doaj   +1 more source

Spatial biology in cancer epigenetics

open access: yesMolecular Oncology, EarlyView.
Spatial epigenomics combines molecular profiling with tissue architecture to reveal how gene regulation is organized within intact tissues. In cancer, these technologies uncover the mechanisms driving tumor heterogeneity and microenvironmental interactions, opening new opportunities for biomarker discovery and precision medicine.
Eva Crespo‐García, Manel Esteller
wiley   +1 more source

Commuting graphs and extremal centralizers

open access: yesArs Mathematica Contemporanea, 2013
We determine the conditions for matrix centralizers which can guarantee the connectedness of the commuting graph for the full matrix algebra M n ( F ) over an arbitrary field F . It is known that if F is an algebraically closed field and n  ≥ 3 , then the diameter of the commuting graph of M n ( F ) is always equal to four.
Dolinar, Gregor   +3 more
openaire   +4 more sources

On Minimum Generalized Degree Distance Index of Cyclic Graphs

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2023
Topological index (TI) is a mapping that associates a real number to the under study (molecular) graph which predicts its various physical and chemical properties.
Nadia Khan   +3 more
doaj   +1 more source

Analysing the significance of small conformational changes and low occupancy states in serial crystallographic data

open access: yesFEBS Open Bio, EarlyView.
This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill   +4 more
wiley   +1 more source

Spectral extremal graphs for the bowtie

open access: yesDiscrete Mathematics, 2023
22 pages, 6 figures.
Yongtao Li, Lu Lu, Yuejian Peng
openaire   +2 more sources

The General Extended Adjacency Eigenvalues of Chain Graphs

open access: yesMathematics
In this article, we discuss the spectral properties of the general extended adjacency matrix for chain graphs. In particular, we discuss the eigenvalues of the general extended adjacency matrix of the chain graphs and obtain its general extended ...
Bilal Ahmad Rather   +3 more
doaj   +1 more source

Transcripts enriched in codons that trigger P‐site tRNA‐mediated mRNA decay possess stable mRNA

open access: yesFEBS Open Bio, EarlyView.
PTMD codons were first described by Mendel et al. as mediators of an mRNA decay pathway dependent on the human protein CNOT3, homologous to yeast Not5. Our findings confirm that PTMD codons destabilize transcripts; however, unlike in yeast, the human pathway specifically targets and slightly destabilizes primarily stable mRNAs.
Rodolfo Lopes Carneiro   +1 more
wiley   +1 more source

Extremal Graphs for Intersecting Triangles

open access: yesJournal of Combinatorial Theory, Series B, 1995
A \(k\)-fan is a graph with \(2k+ 1\) vertices consisting of \(k\) 3-cycles having one vertex in common. The authors show that if \(n\geq 50k^2\) and the graph \(G_n\) has more than \([n^2/4]+ k^2- ck\) edges, where \(c\) equals 1 or 3/2 according as \(k\) is odd or even, then \(G_n\) contains a \(k\)-fan; furthermore, the bound for the number of edges
Paul Erdös   +3 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy