Results 51 to 60 of about 4,006,976 (265)

Targeting transcription factors associated with hemoglobinopathies: Lessons from successful interventions and implications for cancer

open access: yesMolecular Oncology, EarlyView.
This review summarizes the transcription factors, repressive chromatin‐modifying complexes, and epigenetic mechanisms that control fetal hemoglobin repression. Notably, many regulators of γ‐globin silencing also function in transcriptional and epigenetic networks that drive cancer, highlighting opportunities to translate advances in hemoglobinopathy ...
Meigen Yu   +3 more
wiley   +1 more source

A Statistical Learning Method for the Prediction of Anti-HIV Activity Using Topological Indices Based on Steiner Eccentricity

open access: yesJournal of Applied Mathematics
The prediction of molecular activity plays an important role in drug discovery. Various approaches have been devised to predict anti-HIV activity based on topological indices.
Xingfu Li
doaj   +1 more source

On the non-commuting graph of dihedral group

open access: yesElectronic Journal of Graph Theory and Applications, 2020
For a nonabelian group G, the non-commuting graph Γ of G is defined as the graph with vertex-set G-Z(G), where Z(G) is the center of G, and two distinct vertices of Γ are adjacent if they do not commute in G.
Sanhan Muhammad Salih Khasraw   +2 more
doaj   +1 more source

p190A/ARHGAP35 and p190B/ARHGAP5 proteins in endometrial cancer: a novel cancer‐relevant paralog interplay

open access: yesMolecular Oncology, EarlyView.
This study identifies ARHGAP5, in addition to the frequently mutated ARHGAP35, as significantly mutated in endometrial cancer. Mutations in both genes co‐occur and are associated with their correlated downregulation. Functional CRISPR studies show that both paralogs regulate similar pathways, including actin cytoskeleton organization.
Mathilde Pinault   +12 more
wiley   +1 more source

Eccentric connectivity index of chemical trees [PDF]

open access: yesAIP Conference Proceedings, 2016
Let G = (V, E) be a simple connected molecular graph. In such a simple molecular graph, vertices and edges are depicted atoms and chemical bonds respectively, we refer to the sets of vertices by V (G) and edges by E (G). If d(u, v) be distance between two vertices u, v ∈ V(G) and can be defined as the length of a shortest path joining them.
R. S. Haoer   +4 more
openaire   +1 more source

UiO‐66 metal–organic frameworks in biomedicine: From structural tunability to bioimaging, photodiagnostics, and photodynamic cancer therapy

open access: yesFEBS Open Bio, EarlyView.
UiO‐66(Zr) metal–organic frameworks are chemically stable, biocompatible, and highly tunable nanomaterials. Their modular structure enables controlled drug delivery, multimodal bioimaging, and light‐activated photodynamic therapy, supporting integrated diagnostic and therapeutic (theranostic) applications in cancer and biomedical research.
Veronika Huntošová   +2 more
wiley   +1 more source

Degree-Distance Based Topological Indices of Crystal Cubic Carbon Structure

open access: yesAtoms, 2018
Chemical graph theory comprehends the basic properties of an atomic graph. The sub-atomic diagrams are the graphs that are comprised of particles called vertices and the covalent bond between them are called edges.
Hong Yang   +3 more
doaj   +1 more source

MagmaFlow: A desktop platform for artificial intelligence‐driven expression analysis

open access: yesFEBS Open Bio, EarlyView.
MagmaFlow is a free, no‐code platform for gene expression analysis. It generates interactive volcano plots, links genes to literature, pathways, and diseases, prioritizes candidates using millions of publications, identifies affected biological processes, builds network diagrams, and exports publication‐ready figures and reports for macOS and Windows ...
Carlos E. Buss   +7 more
wiley   +1 more source

Computing eccentric connectivity index of nanostar dendrimers

open access: yes, 2017
Let G be a molecular graph, the eccentric connectivity index of G is defined as ξc(G) = Σu∈V(G)deg(u)·ecc(u), where deg(u) denotes the degree of vertex u and ecc(u) is the largest distance between u and any other vertex v of G, namely, eccentricity of u.
Ali Nejati   +2 more
core   +1 more source

Eccentric harmonic index of a graph

open access: yesArab Journal of Basic and Applied Sciences, 2019
In this paper, we introduce the eccentric harmonic index of a graph G, so that it is the sum of the terms for the edges where ei is the eccentricity of the ith vertex of the graph G. We compute the exact values of He for some standard graphs.
M. I. Sowaity   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy