Results 91 to 100 of about 836,691 (279)

RNA Sequencing Resolves Cryptic Pathogenic Variants in Mitochondrial Disease

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
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

Hamilton cycles in almost distance-hereditary graphs

open access: yesOpen Mathematics, 2016
Let G be a graph on n ≥ 3 vertices. A graph G is almost distance-hereditary if each connected induced subgraph H of G has the property dH(x, y) ≤ dG(x, y) + 1 for any pair of vertices x, y ∈ V(H).
Chen Bing, Ning Bo
doaj   +1 more source

Cumulative Social Disadvantage and Disease Activity in Juvenile Idiopathic Arthritis: A Childhood Arthritis and Rheumatology Research Alliance Registry Study

open access: yesArthritis Care &Research, EarlyView.
Objective Social determinants of health (SDOH) contribute to juvenile idiopathic arthritis (JIA) disparities, but most studies have assessed SDOH independently rather than cumulatively across individual, family, and neighborhood levels. Using a socioecological framework, we investigated the relationship among cumulative social disadvantage ...
William Daniel Soulsby   +448 more
wiley   +1 more source

An embedding-based distance for temporal graphs

open access: yesNature Communications
Temporal graphs are commonly used to represent time-resolved relations between entities in many natural and artificial systems. Many techniques were devised to investigate the evolution of temporal graphs by comparing their state at different time points.
Lorenzo Dall’Amico   +2 more
doaj   +1 more source

On Subgraphs in Distance-Regular Graphs [PDF]

open access: yesJournal of Algebraic Combinatorics, 1992
A graph is distance-regular when it is simple and for any two vertices at distance \(j\), the numbers of vertices adjacent to one and at distance \(j- 1\) (resp. \(j\) and \(j+1)\) of the other are constant (depending on \(j\) only). First some necessary conditions are derived for distance- regularity of the subgraph of the geodesics joining two ...
openaire   +3 more sources

Mechanochemical Synthesis and Characterization of Nanostructured ErB4 and NdB4 Rare‐Earth Tetraborides

open access: yesAdvanced Engineering Materials, Volume 27, Issue 6, March 2025.
ErB4 and NdB4 nanostructured powders are produced by mechanochemical synthesis. 5 h mechanical alloying and 4 M HCl acid leaching are used in the production. ErB4 and NdB4 powders exhibit maximum magnetization of 0.4726 emu g−1 accompanied with an antiferromagnetic‐to‐paramagnetic phase transition at about TN = 18 K and 0.132 emu g−1 with a maximum at ...
Burçak Boztemur   +5 more
wiley   +1 more source

What Do Large Language Models Know About Materials?

open access: yesAdvanced Engineering Materials, EarlyView.
If large language models (LLMs) are to be used inside the material discovery and engineering process, they must be benchmarked for the accurateness of intrinsic material knowledge. The current work introduces 1) a reasoning process through the processing–structure–property–performance chain and 2) a tool for benchmarking knowledge of LLMs concerning ...
Adrian Ehrenhofer   +2 more
wiley   +1 more source

On locally $n \times n$ grid graphs

open access: yes, 2019
We investigate locally $n \times n$ grid graphs, that is, graphs in which the neighbourhood of any vertex is the Cartesian product of two complete graphs on $n$ vertices.
Amarra, Carmen   +2 more
core  

Different-distance sets in a graph

open access: yesCommunications in Combinatorics and Optimization, 2019
Summary: A set of vertices \(S\) in a connected graph \(G\) is a different-distance set if, for any vertex \(w\) outside \(S\), no two vertices in \(S\) have the same distance to \(w\). The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.
Hedetniemi, Jason T.   +3 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy