Results 41 to 50 of about 55,177 (267)
Algorithms, 2022 Recent developments in commutative algebra, linear algebra, and graph theory allow us to approach various issues in several fields. Circulant graphs now have a wider range of practical uses, including as the foundation for optical networks, discrete ...
Ahmed El-Mesady +3 more
doaj +1 more source
Design and analysis strategies for robust microbiome ageing research
FEBS Letters, EarlyView.The gut microbiome changes with age and associates with age‐related morbidity and mortality, establishing it as a potential biomarker and intervention target for ageing. Realising this potential requires methodological rigour, yet distinguishing biological signals from methodological artefacts remains challenging across cohorts. This review provides an
Mark Olenik +5 more
wiley +1 more source
Graph schema and best graph type to compare discrete groups: Bar, line, and pie
Frontiers in Psychology, 2022 Different graph types may differ in their suitability to support group comparisons, due to the underlying graph schemas. This study examined whether graph schemas are based on perceptual features (i.e., each graph type, e.g., bar or line graph, has its ...
Fang Zhao, Robert Gaschler
doaj +1 more source
Molecular Oncology, EarlyView.This study shows that lung adenocarcinomas exploit developmental branching morphogenesis to acquire a therapy resistant basal‐like tumour cell state. This process was found to be regulated by combined TP53 loss‐of‐function and type‐I interferon signalling, identifying a novel axis for biomarker and therapeutic target discovery.
Kamila J Bienkowska +13 more
wiley +1 more source
On the bialgebra of functional graphs and differential algebras [PDF]
Discrete Mathematics & Theoretical Computer Science, 1997 We develop the bialgebraic structure based on the set of functional graphs, which generalize the case of the forests of rooted trees. We use noncommutative polynomials as generating monomials of the functional graphs, and we introduce circular and ...
Maurice Ginocchio
doaj +2 more sources
On Topologies on Simple Graphs and Their Applications in Radar Chart Methods
AxiomsThis paper introduces a novel topology (upper approximated G-topology) on vertex sets of graphs using rough upper approximation neighborhoods, extending prior work on graph-induced topologies.
Husniyah Alzubaidi +2 more
doaj +1 more source
Transactions on Combinatorics, 2019 This paper defines the concept of partitioned hypergraphs, and enumerates the number of these hypergraphs and discrete complete hypergraphs. A positive equivalence relation is defined on hypergraphs, this relation establishes a connection between ...
Mohammad Hamidi, Arsham Borumand Saeid
doaj +1 more source
A graph discretization of the Laplace–Beltrami operator [PDF]
Journal of Spectral Theory, 2015 We show that eigenvalues and eigenfunctions of the Laplace–Beltrami operator on a Riemannian manifold are approximated by eigenvalues and eigenvectors of a (suitably weighted) graph Laplace operator of a proximity graph on an epsilon-net.
Burago, D, Ivanov, S, Kurylev, Y
openaire +4 more sources
Translating whole‐genome doubling into precision medicine in cancer
Molecular Oncology, EarlyView.Whole‐genome doubling creates a WGD‐positive tumor state characterized by persistent chromosomal instability, karyotypic diversification, and cellular stress. These same biological pressures drive aggressive tumor evolution while exposing therapeutic vulnerabilities, providing a rationale for WGD‐informed precision medicine. Whole‐genome doubling (WGD)
Sejung Lee, Junghyeok Lim, Jinhyuk Bhin
wiley +1 more source
Exploring the space of graphs with fixed discrete curvatures
Journal of Physics: ComplexityDiscrete curvatures are quantities associated to the nodes and edges of a graph that reflect the local geometry around them. These curvatures have a rich mathematical theory and they have recently found success as a tool to analyze networks across a wide
Michelle Roost +3 more
doaj +1 more source