Results 71 to 80 of about 153,098 (217)
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Cognitive decline is a disabling and variable feature of Parkinson disease (PD). While cholinergic system degeneration is linked to cognitive impairments in PD, most prior research reported cross‐sectional associations. We aimed to fill this gap by investigating whether baseline regional cerebral vesicular acetylcholine transporter ...
Taylor Brown +6 more
wiley +1 more source
On Generalizations of Pairwise Compatibility Graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceA graph $G$ is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree and an interval $I$, such that each leaf of the tree is a vertex of the graph, and there is an edge $\{ x, y \}$ in $G$ if and only if the weight of the path in the
Tiziana Calamoneri +3 more
doaj +1 more source
ALDOA Promotes Glycolysis and NLRP3/GSDMD Pyroptosis to Accelerate ALS Progression
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Amyotrophic lateral sclerosis (ALS) is characterized by progressive motor neuron degeneration. Glycolytic dysregulation is implicated in disease progression, yet the underlying mechanisms remain unclear. This study investigates how Aldolase A (ALDOA) drives ALS progression through glycolysis‐mediated motor neuron pyroptosis.
Kaixin Yan +9 more
wiley +1 more source
A Faster Algorithm for Maximum Induced Matchings on Circle Graphs
Journal of Graph Algorithms and Applications, 2018 Circle graphs have applications to RNA bioinformatics, computational chemistry, and VLSI design. Additionally, many problems that are intractable on general graphs are efficient for circle graphs.
Max Ward +3 more
doaj +1 more source
Relationship Between Neurologic Symptoms and Signs and FMR1 Genotype in Premutation Carriers
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Background and Objectives Fragile X‐associated Tremor/Ataxia Syndrome (FXTAS) is the most severe late‐onset condition caused by a premutation in the FMR1 gene, characterized by expanded CGG triplet repeats of 55–200. Clinical presentations of FXTAS, including gait ataxia, kinetic tremor, cognitive decline, and rare Parkinsonism, are linked to ...
Flora Tassone +8 more
wiley +1 more source
Interval Edge-Colorings of Cartesian Products of Graphs I
Discussiones Mathematicae Graph Theory, 2013 A proper edge-coloring of a graph G with colors 1, . . . , t is an interval t-coloring if all colors are used and the colors of edges incident to each vertex of G form an interval of integers.
Petrosyan Petros A. +2 more
doaj +1 more source
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Considerable efforts have been dedicated to developing effective treatments for post‐stroke executive impairment (PSEI), among which repetitive transcranial magnetic stimulation (rTMS) has shown great potential. This study aimed to investigate the therapeutic effects of high‐frequency rTMS on working memory (WM) and response ...
Mengting Lao +6 more
wiley +1 more source
A Reduction of the Graph Reconstruction Conjecture
Discussiones Mathematicae Graph Theory, 2014 A graph is said to be reconstructible if it is determined up to isomor- phism from the collection of all its one-vertex deleted unlabeled subgraphs. Reconstruction Conjecture (RC) asserts that all graphs on at least three vertices are reconstructible. In
Monikandan S., Balakumar J.
doaj +1 more source
Annals of Clinical and Translational Neurology, EarlyView.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
End Simplicial Vertices in Path Graphs
Discussiones Mathematicae Graph Theory, 2016 A graph is a path graph if there is a tree, called UV -model, whose vertices are the maximal cliques of the graph and for each vertex x of the graph the set of maximal cliques that contains it induces a path in the tree.
Gutierrez Marisa, Tondato Silvia B.
doaj +1 more source