Results 51 to 60 of about 116,736 (298)

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, İsmail Güderer, Yi Wang, Tayyaba Alvi, Prasoon Pandey, Handan Melike Dönertaş   +5 more
wiley   +1 more source

Roman domination number on cardinal product of paths and cycles

Croatian Operational Research Review, 2015
In this paper, the authors have determined certain upper and lower bounds for Roman domination numbers on cardinal products for any two graphs and some exact values for the cardinal product of paths and cycles.
Antoaneta Klobučar, Ivona Puljić
doaj   +1 more source

Structure‐forward targeting of claudins with synthetic binders

FEBS Letters, EarlyView.
Claudins form the paracellular barriers between epithelial and endothelial tissues at tight junctions and are targets for molecular binders with the goal of modulating barrier permeability. Claudin‐binding molecules are relevant in drug delivery or in altering claudin interactions with disease‐causing proteins.
Alex J. Vecchio
wiley   +1 more source

Autophagy and mitophagy in pancreatic β‐cell homeostasis and their involvement in diabetes pathophysiology

FEBS Letters, EarlyView.
This review focuses on the role of autophagy and mitophagy in maintaining pancreatic β‐cell function and homeostasis. We discuss how genetic defects affecting these pathways contribute to the development of type 1, type 2, monogenic, and gestational diabetes. We further explore their potential as therapeutic targets. Created in BioRender.
Yunkyeong Lee, Mingming Tong, Anna L. Gloyn   +2 more
wiley   +1 more source

Non-Crossing Hamiltonian Paths and Cycles in Output-Polynomial Time [PDF]

, 2023
We show that, for planar point sets, the number of non-crossing Hamiltonian paths is polynomially bounded in the number of non-crossing paths, and the number of non-crossing Hamiltonian cycles (polygonalizations) is polynomially bounded in the number of ...
Eppstein, D, Eppstein, David
core   +1 more source

Extrema property of the k-ranking of directed paths and cycles

AKCE International Journal of Graphs and Combinatorics, 2016
A k-ranking of a directed graph G is a labeling of the vertex set of G with k positive integers such that every directed path connecting two vertices with the same label includes a vertex with a larger label in between.
Breeanne Baker Swart, Rigoberto Flórez, Darren A. Narayan, George L. Rudolph   +3 more
doaj   +1 more source

Tumour–host interactions in Drosophila: mechanisms in the tumour micro‐ and macroenvironment

Molecular Oncology, EarlyView.
This review examines how tumour–host crosstalk takes place at multiple levels of biological organisation, from local cell competition and immune crosstalk to organism‐wide metabolic and physiological collapse. Here, we integrate findings from Drosophila melanogaster studies that reveal conserved mechanisms through which tumours hijack host systems to ...
José Teles‐Reis, Tor Erik Rusten
wiley   +1 more source

Monochromatic transversal game on tight paths and tight cycles

Cadernos Cajuína
We explore in this paper a combinatorial maker-breaker game, proposed by Mendes et al. in 2020, named -monochromatic transversal game. Such a game, which is defined over a hypergraph, is played by two competitors, Alice and Bob, that alternately take ...
Wilder Pinto Mendes, Diogo Rubio Sant Anna das Dores, Iuri dos Santos Manoel, Lucas Lima Silva Portugal, Daniela Aparecida Mafra, Ícaro Vitebre Debique Sousa, Antonio Mendes Magalhães Júnior   +6 more
doaj   +1 more source

Edge magic total labeling of lexicographic product C4(2r+1) o ~K2 cycle with chords, unions of paths, and unions of cycles and paths

Indonesian Journal of Combinatorics, 2018
An edge magic total (EMT) labeling of a graph G = (V, E) is a bijection from the set of vertices and edges to a set of numbers defined by λ : V ∪ E → {1, 2, ..., ∣V∣ + ∣E∣} with the property that for every xy ∈ E, the weight of xy equals to a constant k,
Inne Singgih
doaj   +1 more source

The Crossing Numbers of Join Products of Paths and Cycles with Four Graphs of Order Five

Mathematics, 2021
The main aim of the paper is to establish the crossing numbers of the join products of the paths and the cycles on n vertices with a connected graph on five vertices isomorphic to the graph K1,1,3\e obtained by removing one edge e incident with some ...
Michal Staš
doaj   +1 more source