Results 21 to 30 of about 71,849 (256)
Small RNA pathways in mammalian oocytes
Three distinct small RNA pathways operate in mammalian oocytes: RNAi interference (RNAi), the microRNA (miRNA) pathway, and the PIWI‐associated RNA (piRNA) pathway. These pathways use small RNAs to guide sequence‐specific repression and contribute to oocyte biology by targeting genes and mobile elements or appear insignificant since different ...
Petr Svoboda, Josef Pasulka
wiley +1 more source
The cost of perfection for matchings in graphs
Perfect matchings and maximum weight matchings are two fundamental combinatorial structures. We consider the ratio between the maximum weight of a perfect matching and the maximum weight of a general matching. Motivated by the computer graphics application in triangle meshes, where we seek to convert a triangulation into a quadrangulation by merging ...
Emilio Vital Brazil +3 more
openaire +3 more sources
Value of MRI Outcomes for Preventive and Early‐Stage Trials in Spinocerebellar Ataxias 1 and 3
ABSTRACT Objective To examine the value of MRI outcomes as endpoints for preventive and early‐stage trials of two polyglutamine spinocerebellar ataxias (SCAs). Methods A cohort of 100 participants (23 SCA1, 63 SCA3, median Scale for the Assessment and Rating of Ataxia (SARA) score = 5, 42% preataxic, and 14 gene‐negative controls) was scanned at 3T up ...
Thiago J. R. Rezende +26 more
wiley +1 more source
Competitive Equilibria in Decentralized Matching with Incomplete Information [PDF]
This paper shows that all perfect Bayesian equilibria of a dynamic matching game with two-sided incomplete information of independent private values variety are asymptotically Walrasian.
Alp E. Atakan
core +2 more sources
ABSTRACT Objective Onasemnogene abeparvovec (OA) is an AAV9‐based gene therapy for spinal muscular atrophy type I (SMA I). Real‐world outcomes show increased response variability compared to clinical trials, and follow‐up data beyond 12–18 months are limited.
Marika Pane +43 more
wiley +1 more source
Exact Matching and the Top-k Perfect Matching Problem
The aim of this note is to provide a reduction of the Exact Matching problem to the Top-$k$ Perfect Matching Problem. Together with earlier work by El Maalouly, this shows that the two problems are polynomial-time equivalent. The Exact Matching Problem
Maalouly, Nicolas El, Wulf, Lasse
core
Screening Routine Clinical Notes for Epilepsy Surgery Candidates Using Large Language Models
ABSTRACT Objective Epilepsy surgery is severely underutilized despite proven efficacy, with substantial under‐referral of eligible patients in routine clinical practice. This study evaluated the potential role of large language models (LLMs) as decision‐support tools for screening unstructured clinical notes to identify epilepsy surgery candidates and ...
Uriel Fennig +9 more
wiley +1 more source
The Labeled perfect matching in bipartite graphs
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V,E) with |V | = 2n vertices such that E contains a perfect matching (of size n), together ...
Monnot, Jérôme, Jérôme Monnot
core +1 more source
Minimum 2SAT-DELETION: inapproximability results and relations to Minimum Vertex Cover [PDF]
The MINIMUM 2SAT-DELETION problem is to delete the minimum number of clauses in a 2SAT instance to make it satisfiable. It is one of the prototypes in the approximability hierarchy of minimization problems Khanna et al.
Chlebikova, Janka +5 more
core +1 more source
Uncovering G Protein‐Coupled Receptors: Novel Targets and Biomarkers for Predicting Glioma Prognosis
ABSTRACT Background Low‐grade gliomas (LGG) exhibit significant heterogeneity and recurrence risk. G protein‐coupled receptors (GPCR) contribute to glioma malignant progression, but their prognostic value remains unclear. This work attempts to formulate a GPCR‐based outcome‐predicting model for LGG. Methods Based on TCGA LGG data, the enrichment scores
Jun Yang +4 more
wiley +1 more source

