Results 101 to 110 of about 1,003,970 (287)
A duality based 2-approximation algorithm for maximum agreement forest. [PDF]
Olver N +4 more
europepmc +1 more source
Approximate Set Union Via Approximate Randomization [PDF]
We develop an randomized approximation algorithm for the size of set union problem $\arrowvert A_1\cup A_2\cup...\cup A_m\arrowvert$, which given a list of sets $A_1,...,A_m$ with approximate set size $m_i$ for $A_i$ with $m_i\in \left((1-\beta_L)|A_i|, (
Fu, Bin, Gu, Pengfei, Zhao, Yuming
core +2 more sources
Real‐World Performance of CSF Kappa Free Light Chains in the 2024 McDonald Criteria
ABSTRACT Objective Kappa free light chains (KFLCs) in the cerebrospinal fluid (CSF) have a similar performance to CSF‐restricted oligoclonal bands (OCB) for multiple sclerosis (MS) diagnosis. To help with implementation, we set out to resolve several remaining uncertainties: (1) performance in a real‐world cohort and the 2024 McDonald criteria; (2 ...
Maya M. Leibowitz +11 more
wiley +1 more source
Complexity of Roman {2}-domination and the double Roman domination in graphs
For a simple, undirected graph a Roman {2}-dominating function (R2DF) has the property that for every vertex with f(v) = 0, either there exists a vertex with f(u) = 2, or at least two vertices with The weight of an R2DF is the sum The minimum weight of ...
Chakradhar Padamutham +1 more
doaj +1 more source
A new 1.375-approximation algorithm for sorting by transpositions. [PDF]
Silva LAG +3 more
europepmc +1 more source
ABSTRACT Objective To investigate the value of constructing models based on habitat radiomics and pathomics for predicting the risk of progression in high‐grade gliomas. Methods This study conducted a retrospective analysis of preoperative magnetic resonance (MR) images and pathological sections from 72 patients diagnosed with high‐grade gliomas (52 ...
Yuchen Zhu +14 more
wiley +1 more source
Scelestial: Fast and accurate single-cell lineage tree inference based on a Steiner tree approximation algorithm. [PDF]
Foroughmand-Araabi MH +2 more
europepmc +1 more source
Improving Christofides' Algorithm for the s-t Path TSP [PDF]
We present a deterministic (1+sqrt(5))/2-approximation algorithm for the s-t path TSP for an arbitrary metric. Given a symmetric metric cost on n vertices including two prespecified endpoints, the problem is to find a shortest Hamiltonian path between ...
An, Hyung-Chan +2 more
core
ABSTRACT Objective Glioma recurrence severely impacts patient prognosis, with current treatments showing limited efficacy. Traditional methods struggle to analyze recurrence mechanisms due to challenges in assessing tumor heterogeneity, spatial dynamics, and gene networks.
Lei Qiu +10 more
wiley +1 more source
Approximation algorithm for rearrangement distances considering repeated genes and intergenic regions. [PDF]
Siqueira G +3 more
europepmc +1 more source

