Results 121 to 130 of about 735,632 (298)
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
Signed graphs connected with the root lattice
For any base of the root lattice (An) we can construct a signed graph. A signed graph is one whose edges are signed by +1 or -1. A signed graph is balanced if and only if its vertex set can be divided into two sets-either of which may be empty–so that ...
RN Yadav
doaj +1 more source
RNA Sequencing Resolves Cryptic Pathogenic Variants in Mitochondrial Disease
ABSTRACT Objective Mitochondrial diseases are the most common inherited metabolic disorders, characterized by pronounced clinical and genetic heterogeneity that complicates molecular diagnosis. Although DNA‐based sequencing approaches have become standard in genetic testing, up to half of patients remain without a definitive diagnosis.
Zhimei Liu +21 more
wiley +1 more source
Spectral characterizations of signed lollipop graphs [PDF]
Let Γ=(G,σ) be a signed graph, where G is the underlying simple graph and σ:E(G)→{+,-} is the sign function on the edges of G. In this paper we consider the spectral characterization problem extended to the adjacency matrix and Laplacian matrix of signed
BELARDO, Francesco, Petecki, Paweł
core +1 more source
Signed Total Roman Edge Domination In Graphs
Let G = (V,E) be a simple graph with vertex set V and edge set E. A signed total Roman edge dominating function of G is a function f : Ʃ → {−1, 1, 2} satisfying the conditions that (i) Ʃe′∈N(e) f(e′) ≥ 1 for each e ∈ E, where N(e) is the open ...
Asgharsharghi Leila +1 more
doaj +1 more source
Offensive alliances in signed graphs
Signed graphs have been introduced to enrich graph structures expressing relationships between persons or general social entities, introducing edge signs to reflect the nature of the relationship, e.g., friendship or enmity. Independently, offensive alliances have been defined and studied for undirected, unsigned graphs.
Zhidan Feng 0002 +3 more
openaire +5 more sources
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
ABSTRACT Objective Isolated rapid eye movement sleep behavior disorder (iRBD) is a prodromal state for Lewy body disorders and exhibits biological heterogeneity that may influence clinical expression and progression. We examined clinical features in individuals with iRBD and biomarker‐defined synucleinopathy.
Daniel Weintraub +24 more
wiley +1 more source
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
On the largest eigenvalue of signed unicyclic graphs
Signed graphs are graphs whose edges get signs ±1 and, as for unsigned graphs, they can be studied by means of graph matrices. Here we focus our attention to the largest eigenvalue, also known as the index of the adjacency matrix of signed graphs ...
Souri M. +4 more
core +1 more source

