Results 171 to 180 of about 2,234,974 (362)
Assortative matching through signals [PDF]
We model signalling in two-sided sequential search with heterogeneous agents and transferable utility. Search via meetings is time-consuming and thereby costly due to discounting. Search via signals is costless, so that agents can avoid almost all search
Friedrich Poeschel
core
Automated generation of comparator patients in the electronic medical record
Background Well‐designed randomized trials provide high‐quality clinical evidence but are not always feasible or ethical. In their absence, the electronic medical record (EMR) presents a platform to conduct comparative effectiveness research, central to ...
Joseph Rigdon +6 more
doaj +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
Match Stability with a Costly and Flexible Number of Positions
One of the main goals of two-sided matching mechanisms is to pair two groups of agents in a stable manner. Stability means that no pair of agents has an incentive to deviate from their assigned match.
James Gilmore, David Porter
doaj +1 more source
Finding novel vulnerabilities of hypomorphic BRCA1 alleles
Synthetic lethality screens performed to identify novel vulnerabilities often model complete gene loss, thereby overlooking patient‐derived hypomorphic mutations. In this study, we have performed genome‐wide CRISPR screens on BRCA1 hypomorphic mutations, showing BRCA1I26A behaves like wild‐type, while BRCA1R1699Q mimics deficiency. Furthermore, we have
Anne Schreuder +10 more
wiley +1 more source
Graph Pattern Matching: From Intractable to Polynomial Time [PDF]
Graph pattern matching is typically defined in terms of sub-graph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often too restrictive to characterize patterns in emerging applications. We propose
Li, Jianzhong +5 more
core
MITF maintains genome stability in nonmelanocyte lineages
MITF is essential for melanocyte survival and acts as an oncogene in 10%–20% of melanomas. We show that MITF depletion causes genome instability in nonmelanocytic cells, leading to LATS2‐mediated P53 activation, cell cycle arrest, and apoptosis. This study highlights the role of MITF as a genome maintenance factor beyond the melanocyte lineage. Created
Drifa H. Gudmundsdottir +13 more
wiley +1 more source
Matching of RFID car tags to train axles at MERMEC [PDF]
openA crucial step in railway diagnostics is the capability of correctly matching data coming from different sensors. For example, in some measurement systems, cars are identified and detected using RFID tags, while the information about axles are ...
GASPARINI, MARCO
core
Genetic Algorithms for a Scheduling Problem of Parcel Delivery and Pickup by Drones
Recent studies have been conducted actively on scheduling in a parcel delivery system using a truck and drones to deliver parcels more effectively. In logistics, it is necessary to provide not only delivery service but also pickup service, and drones can
Yohei Hazama +2 more
doaj +1 more source

