Results 41 to 50 of about 23,593 (263)

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

Solving systems of linear equations through zero forcing set and application to lights out

CoRR, 2022
Let $\mathbb{F}$ be any field, we consider solving $Ax=b$ repeatedly for a matrix $A\in\mathbb{F}^{n\times n}$ of $m$ non-zero elements, and multiple different $b\in\mathbb{F}^{n}$. If we are given a zero forcing set of $A$ of size $k$, we can then build a data structure in $O(mk)$ time, such that each instance of $Ax=b$ can be solved in $O(k^2+m ...
Jianbo Wang, Chao Xu, Siyun Zhou
openaire   +2 more sources

TRAIL‐PEG‐Apt‐PLGA nanosystem as an aptamer‐targeted drug delivery system potential for triple‐negative breast cancer therapy using in vivo mouse model

Molecular Oncology, EarlyView.
Aptamers are used both therapeutically and as targeting agents in cancer treatment. We developed an aptamer‐targeted PLGA–TRAIL nanosystem that exhibited superior therapeutic efficacy in NOD/SCID breast cancer models. This nanosystem represents a novel biotechnological drug candidate for suppressing resistance development in breast cancer.
Gulen Melike Demirbolat, Aslihan Kucuk, Omer Erdogan, Samed Ozer, Bensu Kozan, Tugba Cuceli, Erkan Gumus, Evrim Cevik, Ozge Cevik   +8 more
wiley   +1 more source

Failed Zero Forcing Numbers of Trees and Circulant Graphs

Theory and Applications of Graphs
Given a graph $G$, the zero forcing number of $G$, $Z(G)$, is the smallest cardinality of any set $S$ of vertices on which repeated applications of the forcing rule (described below) results in all vertices being in $S$.
Luis Gomez , Karla Rubi, Jorden Terrazas , Rigoberto Florez , Darren A. Narayan   +4 more
doaj   +1 more source

Network divergence analysis identifies adaptive gene modules and two orthogonal vulnerability axes in pancreatic cancer

Molecular Oncology, EarlyView.
Tumors contain diverse cellular states whose behavior is shaped by context‐dependent gene coordination. By comparing gene–gene relationships across biological contexts, we identify adaptive transcriptional modules that reorganize into distinct vulnerability axes.
Brian Nelson, Lyanne Delgado‐Coka, Natalia Marchenko, Luisa F. Escobar‐Hoyos, Kenneth R. Shroyer, Alisa Yurovsky, Trey Ideker, Gábor Balázsi, Thomas MacCarthy, Scott Powers   +9 more
wiley   +1 more source

Failed Skew Zero Forcing Numbers of Path Powers and Circulant Graphs

AppliedMath
For a graph G, the zero forcing number of G, Z(G), is defined to be the minimum cardinality of a set S of vertices for which repeated applications of the forcing rule results in all vertices being in S. The forcing rule is as follows: if a vertex v is in
Aidan Johnson, Andrew Vick, Rigoberto Flórez, Darren A. Narayan   +3 more
doaj   +1 more source

Design Optimization for Low-Complexity FPGA Implementation of Symbol-Level Multiuser Precoding

IEEE Access, 2021
This paper proposes and validates a low-complexity FPGA design for symbol-level precoding (SLP) in multiuser multiple-input single-output (MISO) downlink communication systems. In the optimal case, the symbol-level precoded transmit signal is obtained as
Alireza Haqiqatnejad, Jevgenij Krivochiza, Juan Carlos Merlano Duncan, Symeon Chatzinotas, Bjorn Ottersten   +4 more
doaj   +1 more source

Exploring the influence of graph operations on zero forcing sets

Discrete Mathematics
Zero forcing in graphs is a coloring process where a colored vertex can force its unique uncolored neighbor to be colored. A zero forcing set is a set of initially colored vertices capable of eventually coloring all vertices of the graph. In this paper, we focus on the numbers $z(G; i)$, which is the number of zero forcing sets of size $i$ of the graph
Krishna Menon, Anurag Singh 0003
openaire   +3 more sources

Interpreting the effects of DNA polymerase variants at the structural level

Molecular Oncology, EarlyView.
Using MAVISp and molecular dynamics simulations, we analyzed over 60 000 missense variants in POLE and POLD1 from ClinVar, COSMIC, cBioPortal, and saturation mutagenesis. Identified mechanistic indicators, including stability, binding, and long‐range, enable structural interpretation, providing ACMG‐like evidence for possible reclassification of VUS ...
Matteo Arnaudi, Karolina Krzesińska, Ludovica Beltrame, Pablo Sánchez‐Izquierdo Besora, Matteo Tiberti, Mef Nilbert, Anna Rohlin, Elena Papaleo   +7 more
wiley   +1 more source

Performance analysis of joint transmit antenna selection and user scheduling for massive MIMO systems

Cogent Engineering, 2021
To alleviate the problem of hardware complexity, energy wastage and increased cost of deployment in massive multiple input multiple output (MIMO) system, joint antenna selection and user scheduling (JASUS) algorithms are proposed which reduce the ...
Fikreselam Gared Mengistu, Gizachew Worku   +1 more
doaj   +1 more source