Results 121 to 130 of about 1,503,165 (299)
ABSTRACT Objective To evaluate the expression of nine blood RNA biomarkers in a clinical trial based on genes previously identified in an experimental monkey model of stroke for diagnosis feasibility and prognostication. Methods IBIS‐CT1 was a prospective longitudinal study enrolling patients with ischemic stroke (IS) or intracerebral hemorrhage (ICH ...
Salomé Retailleau +11 more
wiley +1 more source
A tabu search heuristic based on k-diamonds for the weighted feedback vertex set problem
Given an undirected and vertex weighted graph G = (V,E,w), the Weighted Feedback Vertex Problem (WFVP) consists of finding a subset F ⊆ V of vertices of minimum weight such that each cycle in G contains at least one vertex in F.
Gentili, Monica +3 more
core +1 more source
Convexities related to path properties on graphs; a unified approach [PDF]
Path properties, such as 'geodesic', 'induced', 'all paths' define a convexity on a connected graph. The general notion of path property, introduced in this paper, gives rise to a comprehensive survey of results obtained by different authors for a ...
Changat, M., Sierksma, G., Mulder, H.M.
core
Arterial Spin‐Labeling MRI at the Cortical‐CSF Interface: A Novel Biomarker in Alzheimer Disease
ABSTRACT Background/Objective Arterial spin‐labeling (ASL) MRI can measure perfusion signal adjacent to CSF spaces and may provide information regarding CSF‐adjacent water transport physiology. We developed an automated pipeline to extract cortical‐CSF interface (IF) perfusion for comparison between Alzheimer disease (AD) and cognitively normal ...
Mona Asghariahmadabad +22 more
wiley +1 more source
Interval Edge-Colorings of Cartesian Products of Graphs I
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
A characterization of the Total Graph of Interval Graphs and Proper Interval Graphs
An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighbourhood of the third vertex. Let G be a graph with vertex set V (G) and edge set E(G), the total graph T(G) of G has vertex set V (G)∪E(G) and two vertices in T(G) are adjacent if and only if they are adjacent or incident in G.
Athul T B, G Suresh Singh
openaire +1 more source
ABSTRACT Objective Amyotrophic lateral sclerosis (ALS) is a clinically heterogeneous neurodegenerative disease requiring reliable biomarkers to improve patient stratification and trial design. While serum neurofilament light chain (sNfL) reflects neuroaxonal stress and disease aggressiveness, troponin T (TnT) may capture complementary aspects of ...
Julia Sellin +8 more
wiley +1 more source
ABSTRACT Objective Progression independent of relapse activity is a major determinant of long‐term disability in multiple sclerosis, but its immunopathologic basis remains incompletely understood. We investigated whether relapse‐independent progression in radiologically stable relapsing–remitting multiple sclerosis is associated with distinct ...
Antonio Bruno +19 more
wiley +1 more source
A Reduction of the Graph Reconstruction Conjecture
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
Leaps: an approach to the block structure of a graph [PDF]
To study the block structure of a connected graph G=(V,E), we introduce two algebraic approaches that reflect this structure: a binary operation + called a leap operation and a ternary relation L called a leap system, both on a finite, nonempty set V ...
Mulder, H.M., Nebesky, L.
core

