Results 61 to 70 of about 14,713,178 (309)

Organoids in pediatric cancer research

open access: yesFEBS Letters, EarlyView.
Organoid technology has revolutionized cancer research, yet its application in pediatric oncology remains limited. Recent advances have enabled the development of pediatric tumor organoids, offering new insights into disease biology, treatment response, and interactions with the tumor microenvironment.
Carla Ríos Arceo, Jarno Drost
wiley   +1 more source

Application of Haddon’s matrix in qualitative research methodology: an experience in burns epidemiology [PDF]

open access: yes
Background: Little has been done to investigate the application of injury specific qualitative research methods in the field of burn injuries. The aim of this study was to use an analytical tool (Haddon’s matrix) through qualitative research methods to ...
عرشی, شهنام   +4 more
core   +1 more source

Quasi-permutation Representations of Borel and Parabolic Subgroups of Steinberg's triality groups [PDF]

open access: yesIranian Journal of Numerical Analysis and Optimization, 2009
If G is a finite linear group of degree n, that is, a finite group of automor-phisms of an n-dimensional complex vector space, or equivalently, a finite group of non-singular matrices of order n with complex coefficients, we shall say that G is a quasi ...
M. Ghorbany
doaj   +1 more source

Septin 9 PB domains coordinate centrosome positioning and microtubule acetylation to control epithelial polarity

open access: yesFEBS Letters, EarlyView.
Septin 9 polybasic domains couple phosphoinositide‐rich membrane binding to centrosome positioning, Golgi organization, and microtubule acetylation to control epithelial polarity. Their loss disrupts this axis, causing centrosome mispositioning, Golgi fragmentation, reduced microtubule acetylation, and polarity inversion via upregulation of the ...
Ting ting Cai   +4 more
wiley   +1 more source

Hybridization of electromagnetic numerical methods through the G-matrix algorithm [PDF]

open access: yesOptics Letters, 2008
For the sake of numerical performance, we hybridize two common approaches often used in electromagnetic computations, namely the finite-element method and the aperiodic Fourier modal method. To that end, we propose an extension of the classical S-matrix formalism to numerical situations, which requires handling different mathematical representations of
Hugonin, Jean-Paul   +2 more
openaire   +3 more sources

Characteristic Polynomial of Antiadjacency Matrix of Several Classes of Graph Join

open access: yesIndonesian Journal of Combinatorics
Suppose G is a simple and undirected graph. The adjacency matrix of graph G, denoted by A(G) is a square matrix that representing graph G based on the adjacency of vertices on G, denoted by A(G). The antiadjacency matrix of graph G is a matrix B(G)=J−A(G)
Anthony Arthur Ataupah   +1 more
doaj   +1 more source

The sum of the largest and smallest signless laplacian eigenvalues and some Hamiltonian properties of graphs

open access: yesCommunications in Advanced Mathematical Sciences, 2018
The signless Laplacian eigenvalues of a graph $G$ are eigenvalues of the matrix $Q(G) = D(G) + A(G)$, where $D(G)$ is the diagonal matrix of the degrees of the vertices in $G$ and $A(G)$ is the adjacency matrix of $G$.
Rao Li
doaj   +1 more source

Microbiome−host proteostasis crosstalk—An emerging perspective on mechanisms and interventions toward healthy longevity

open access: yesFEBS Letters, EarlyView.
Proteostasis and the gut microbiota play a key role in shaping host physiology. Microbiota‐derived metabolites, vitamins, and RNA modulate host proteostasis. Findings from model systems, including C. elegans, indicate microbes can either stabilize or disrupt host proteostasis.
Abhishek Anil Dubey, Maria Ermolaeva
wiley   +1 more source

The Aα-Spectral Radii of Graphs with Given Connectivity

open access: yesMathematics, 2019
The A α -matrix is A α ( G ) = α D ( G ) + ( 1 − α ) A ( G ) with α ∈ [ 0 , 1 ] , given by Nikiforov in 2017, where A ( G ) is adjacent matrix, and D ( G ) is its ...
Chunxiang Wang, Shaohui Wang
doaj   +1 more source

On the distance α-spectral radius of a connected graph

open access: yesJournal of Inequalities and Applications, 2020
For a connected graph G and α ∈ [ 0 , 1 ) $\alpha \in [0,1)$ , the distance α-spectral radius of G is the spectral radius of the matrix D α ( G ) $D_{\alpha }(G)$ defined as D α ( G ) = α T ( G ) + ( 1 − α ) D ( G ) $D_{\alpha }(G)=\alpha T(G)+(1-\alpha )
Haiyan Guo, Bo Zhou
doaj   +1 more source

Home - About - Disclaimer - Privacy