Results 81 to 90 of about 855,405 (264)

Adjunctive Therapeutic Plasma Exchange in Refractory Adult‐Onset Still's Disease Complicated by Secondary Macrophage Activation Syndrome: A Single‐Center Experience

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Introduction Adult‐onset Still's disease (AOSD) complicated by macrophage activation syndrome (MAS) carries substantial mortality. The role of therapeutic plasma exchange (TPE) remains uncertain. Methods We retrospectively analyzed patients with AOSD‐MAS treated with TPE at a single‐center.
Masataka Ueda   +15 more
wiley   +1 more source

Metric Dimension of Circulant Graphs with 5 Consecutive Generators

open access: yesMathematics
The problem of finding the metric dimension of circulant graphs with t generators 1,2,…,t (and their inverses) has been extensively studied. The problem is solved for t=2,3,4, and some exact values and bounds are known also for t=5. We solve all the open
Martin Knor   +2 more
doaj   +1 more source

Revealing the structure of land plant photosystem II: the journey from negative‐stain EM to cryo‐EM

open access: yesFEBS Letters, EarlyView.
Advances in cryo‐EM have revealed the detailed structure of Photosystem II, a key protein complex driving photosynthesis. This review traces the journey from early low‐resolution images to high‐resolution models, highlighting how these discoveries deepen our understanding of light harvesting and energy conversion in plants.
Roman Kouřil
wiley   +1 more source

Computing Metric Dimension of Certain Families of Toeplitz Graphs

open access: yesIEEE Access, 2019
The position of a moving point in a connected graph can be identified by computing the distance from the point to a set of sonar stations which have been appropriately situated in the graph. Let Q = {q1, q2, ...
Jia-Bao Liu   +3 more
doaj   +1 more source

The metric dimension and metric independence of a graph [PDF]

open access: yes, 2001
A vertex x of a graph G resolves two vertices u and v of G if the distance from x to u does not equal the distance from x to v. A set S of vertices of G is a resolving set for G if every two distinct vertices of G are resolved by some vertex of S. The
Currie, James, Oellerman, Ortrud R.
core  

Mapping the evolution of mitochondrial complex I through structural variation

open access: yesFEBS Letters, EarlyView.
Respiratory complex I (CI) is crucial for bioenergetic metabolism in many prokaryotes and eukaryotes. It is composed of a conserved set of core subunits and additional accessory subunits that vary depending on the organism. Here, we categorize CI subunits from available structures to map the evolution of CI across eukaryotes. Respiratory complex I (CI)
Dong‐Woo Shin   +2 more
wiley   +1 more source

On the strong partition dimension of graphs [PDF]

open access: yes, 2013
We present a different way to obtain generators of metric spaces having the property that the ``position'' of every element of the space is uniquely determined by the distances from the elements of the generators.
Yero, Ismael Gonzalez
core  

Displacing Lagrangian toric fibers by extended probes

open access: yes, 2013
In this paper we introduce a new way of displacing Lagrangian fibers in toric symplectic manifolds, a generalization of McDuff's original method of probes. Extended probes are formed by deflecting one probe by another auxiliary probe.
Borman   +6 more
core   +3 more sources

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

Total resolving number of edge cycle graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2020
Let be a simple connected graph. An ordered subset W of V is said to be a resolving set of G if every vertex is uniquely determined by its vector of distances to the vertices in W. The minimum cardinality of a resolving set is called the resolving number
J. Paulraj Joseph, N. Shunmugapriya
doaj   +1 more source

Home - About - Disclaimer - Privacy