Results 171 to 180 of about 4,129,862 (348)
Multivariate data often exhibit complex dependencies that violate the assumption of isotropic residual noise. For such cases, we introduce Graph Regularized PCA (GR-PCA). It is a graph-based regularization of PCA that incorporates the dependency structure of the data features by learning a sparse precision graph and biasing loadings toward the low ...
Antonio Briola +6 more
openaire +3 more sources
The PAM pathway and its impact on cellular metabolism. Color‐coded key symbols represent Rapamycin (R, orange, targeting mTOR) and Dactolisib (D, green, targeting PI3K/mTOR), indicating their sites of action. Created with BioRenders.com. Glioblastoma resists therapy through interconnected survival programs.
Kai Zhao +23 more
wiley +1 more source
Life‐science educators from 14 countries redesigned their own course materials with generative AI in a three‐session, pedagogy‐first FEBS Education and Training Academy workshop built on PICRAT. Among 12 matched respondents, four more reported high confidence in each of five practical domains, and 10 of 13 reported implementing at least one idea ...
Zvonimir Mlinarić, Ali Burak Özkaya
wiley +1 more source
AbstractH.M. Mulder introduced (0,λ)-graphs and proved that maximum (0,λ)-graphs are hypercubes. One way of generalization of this concept is to consider cycle-regular graphs. We prove that these graphs have also some regularity properties and that maximum [3, 1, 6]-cycle regular graphs are also related to hypercubes.
openaire +2 more sources
Representation and generation of plans using graph spectra [PDF]
Numerical comparison of spaces with one another is often achieved with set scalar measures such as global and local integration, connectivity, etc., which capture a particular quality of the space but therefore lose much of the detail of its overall ...
Hanna, S.
core
r-regular families of graph automorphisms
An r-regular family F of permutations on a set V contains, for each pair of vertices u,v∈V, exactly r permutations φ mapping u to v. Earlier, 1-regular families of graph automorphisms were used by Gauyacq to define the quasi-Cayley graphs, a class of ...
Jones, Gareth A. +3 more
core +1 more source
GBS‐MeDIP: A method for the simultaneous identification of genetic and epigenetic variants in tumors
GBS‐MeDIP combines DNA sequencing with enrichment of methylated DNA to profile genetic and epigenetic variation in the same reduced genomic fraction. Applied to gastric cancer and parathyroid tumors, it identifies sequence variants, copy number changes, and differentially methylated regions together, helping distinguish true epigenetic changes from ...
Fábio Pértille +6 more
wiley +1 more source
ABSTRACT Objective To evaluate the efficacy and safety of ofatumumab in patients with myelin oligodendrocyte glycoprotein antibody–associated disease (MOGAD), and compare it with rituximab. Methods We conducted a single–center, observational study including 22 MOGAD patients treated with ofatumumab and 21 treated with rituximab.
Yuxin Fan +5 more
wiley +1 more source
A spanning subgraph F of a graph G is called a [k-1,k]-factor if \(k-1\leq d_ F(x)\leq k\) for all vertices of x of G, where \(d_ F(x)\) denotes the degree of x in F. \textit{W. T. Tutte} [The subgraph problem, Ann. Discrete Math. 3, 289-295 (1978; Zbl 0377.05034)] proved that if r is an odd integer, then every r-regular graph has a [k-1,k]-factor for ...
openaire +3 more sources
ABSTRACT Objective To characterize the demographic, clinical, and laboratory features of the Chinese patients of genetic Creutzfeldt‐Jakob disease with T188K variant (T188K‐gCJD), the most common subtype of genetic prion diseases (gPrDs) in China. Methods In this nationwide retrospective study, data from 98 genetically confirmed T188K‐gCJD patients ...
Chun‐Jie Li +11 more
wiley +1 more source

