Results 91 to 100 of about 832,958 (281)

An embedding-based distance for temporal graphs

open access: yesNature Communications
Temporal graphs are commonly used to represent time-resolved relations between entities in many natural and artificial systems. Many techniques were devised to investigate the evolution of temporal graphs by comparing their state at different time points.
Lorenzo Dall’Amico   +2 more
doaj   +1 more source

FGFR Like1 drives esophageal cancer progression via EMT, PI3K/Akt, and notch signalling: insights from clinical data and next‐generation sequencing analysis

open access: yesFEBS Open Bio, EarlyView.
Clinical analysis reveals significant dysregulation of FGFRL1 in esophageal cancer (EC) patients. RNAi‐coupled next‐generation sequencing (NGS) and in vitro study reveal FGFRL1‐mediated EC progression via EMT, PI3K/Akt, and Notch pathways. Functional assays confirm its role in tumor growth, migration, and invasion.
Aprajita Srivastava   +3 more
wiley   +1 more source

Hamilton cycles in almost distance-hereditary graphs

open access: yesOpen Mathematics, 2016
Let G be a graph on n ≥ 3 vertices. A graph G is almost distance-hereditary if each connected induced subgraph H of G has the property dH(x, y) ≤ dG(x, y) + 1 for any pair of vertices x, y ∈ V(H).
Chen Bing, Ning Bo
doaj   +1 more source

Evaluation of in vitro toxicity of common phytochemicals included in weight loss supplements using 1H NMR spectroscopy

open access: yesFEBS Open Bio, EarlyView.
We investigated the toxicity of 12 active compounds commonly found in herbal weight loss supplements (WLS) using human liver and colon cell models. Epigallocatechin‐3‐gallate was the only compound showing significant toxicity. Metabolic profiling revealed protein degradation, disrupted energy and lipid metabolism suggesting that the inclusion of EGCG ...
Emily C. Davies   +3 more
wiley   +1 more source

On Subgraphs in Distance-Regular Graphs [PDF]

open access: yesJournal of Algebraic Combinatorics, 1992
A graph is distance-regular when it is simple and for any two vertices at distance \(j\), the numbers of vertices adjacent to one and at distance \(j- 1\) (resp. \(j\) and \(j+1)\) of the other are constant (depending on \(j\) only). First some necessary conditions are derived for distance- regularity of the subgraph of the geodesics joining two ...
openaire   +3 more sources

dUTPase is essential in zebrafish development and possesses several single‐nucleotide variants with pronounced structural and functional consequences

open access: yesFEBS Open Bio, EarlyView.
dUTPases are involved in balancing the appropriate nucleotide pools. We showed that dUTPase is essential for normal development in zebrafish. The different zebrafish genomes contain several single‐nucleotide variations (SNPs) of the dut gene. One of the dUTPase variants displayed drastically lower protein stability and catalytic efficiency as compared ...
Viktória Perey‐Simon   +6 more
wiley   +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

Different-distance sets in a graph

open access: yesCommunications in Combinatorics and Optimization, 2019
Summary: A set of vertices \(S\) in a connected graph \(G\) is a different-distance set if, for any vertex \(w\) outside \(S\), no two vertices in \(S\) have the same distance to \(w\). The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.
Hedetniemi, Jason T.   +3 more
openaire   +3 more sources

Functional Connectivity Linked to Cognitive Recovery After Minor Stroke

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Patients with minor stroke exhibit slowed processing speed and generalized alterations in functional connectivity involving frontoparietal cortex (FPC). The pattern of connectivity evolves over time. In this study, we examine the relationship of functional connectivity patterns to cognitive performance, to determine ...
Vrishab Commuri   +7 more
wiley   +1 more source

Home - About - Disclaimer - Privacy