Results 81 to 90 of about 236,951 (263)
In stable matching, one must find a matching between two sets of agents, commonly men and women, or job applicants and job positions. Each agent has a preference ordering over who they want to be matched with. Moreover a matching is said to be stable if no pair of agents prefer each other over their current matching. We consider solving stable matching
Andrei Constantinescu 0001 +3 more
openaire +2 more sources
Beyond its role in immune evasion, this study identified that CD47 drives tumor‐intrinsic signaling in non‐small cell lung cancer (NSCLC). Transcriptomic profiling and functional studies revealed that CD47 regulates cell adhesion, migration, and metastasis through an ERK–EMT signaling axis.
Asa P.Y. Lau +8 more
wiley +1 more source
EXOSC10, an essential nuclear RNA exosome‐associated 3′‐5′ exoribonuclease, is inhibited by the anticancer drug 5‐fluorouracil (5‐FU), and EXOSC10 depletion increases 5‐FU sensitivity. The colon‐cancer variant EXOSC10S402T, located in a proteolysis motif, is stable and nuclear but nonfunctional in vivo.
Radhika Sain +10 more
wiley +1 more source
We show how fragile stable matchings are in a decentralized one-to-one matching setting. The classical work of Roth and Vande Vate (1990) suggests simple decentralized dynamics in which randomly-chosen blocking pairs match successively. Such decentralized interactions guarantee convergence to a stable matching.
openaire +2 more sources
RNA profiling of circulating extracellular vesicles (EVs) from blood samples of men undergoing prostate biopsy identifies transcripts associated with clinically significant prostate cancer. Integrative analysis with public tumor datasets links EV‐derived gene signatures to tumor stage and progression‐free survival, highlighting CASP3, XRCC2, and RIT1 ...
Stefan Werner +14 more
wiley +1 more source
This study shows that lung adenocarcinomas exploit developmental branching morphogenesis to acquire a therapy resistant basal‐like tumour cell state. This process was found to be regulated by combined TP53 loss‐of‐function and type‐I interferon signalling, identifying a novel axis for biomarker and therapeutic target discovery.
Kamila J Bienkowska +13 more
wiley +1 more source
Computing relaxations for the three-dimensional stable matching problem with cyclic preferences. [PDF]
Cseh Á, Escamocher G, Quesada L.
europepmc +1 more source
Loss of IGF‐1R impairs DNA‐PKcs recruitment to chromatin leading to defective end‐joining
IGF‐1R promotes radioresistance by facilitating DNA‐PKcs recruitment to chromatin, enabling non‐homologous end‐joining (NHEJ) repair of double‐strand breaks. Inhibition or loss of IGF‐1R disrupts this recruitment to damage sites, driving compensatory reliance on microhomology‐mediated end‐joining (MMEJ) repair.
Matthew O. Ellis +3 more
wiley +1 more source
A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences. [PDF]
Cseh Á +3 more
europepmc +1 more source
Many allocation and matching problems (e.g., student-school assignments, job allocation, organ donation) involve coupling agents based on mutual preferences. A central requirement in matching problems is that of stability, that is classically defined as follows: a matching is stable if no blocking pair exists, where a blocking pair is a pair of agents ...
Fanelli, Angelo, Moscardelli, Luca
openaire +2 more sources

