Results 41 to 50 of about 39,432 (269)

Tumour–host interactions in Drosophila: mechanisms in the tumour micro‐ and macroenvironment

open access: yesMolecular Oncology, EarlyView.
This review examines how tumour–host crosstalk takes place at multiple levels of biological organisation, from local cell competition and immune crosstalk to organism‐wide metabolic and physiological collapse. Here, we integrate findings from Drosophila melanogaster studies that reveal conserved mechanisms through which tumours hijack host systems to ...
José Teles‐Reis, Tor Erik Rusten
wiley   +1 more source

From Nash Equilibria to Chain Recurrent Sets: An Algorithmic Solution Concept for Game Theory

open access: yesEntropy, 2018
In 1950, Nash proposed a natural equilibrium solution concept for games hence called Nash equilibrium, and proved that all finite games have at least one.
Christos Papadimitriou   +1 more
doaj   +1 more source

COMP–PMEPA1 axis promotes epithelial‐to‐mesenchymal transition in breast cancer cells

open access: yesMolecular Oncology, EarlyView.
This study reveals that cartilage oligomeric matrix protein (COMP) promotes epithelial‐to‐mesenchymal transition (EMT) in breast cancer. We identify PMEPA1 (protein TMEPAI) as a novel COMP‐binding partner that mediates EMT via binding to the TSP domains of COMP, establishing the COMP–PMEPA1 axis as a key EMT driver in breast cancer.
Konstantinos S. Papadakos   +6 more
wiley   +1 more source

Considerations on probability: from games of chance to modern science

open access: yesStatistica, 2015
The article sets out a number of considerations on the distinction between variability and uncertainty over the centuries. Games of chance have always been useful random experiments which through combinatorial calculation have opened the way to ...
Paola Monari
doaj   +1 more source

$2^3$ Quantified Boolean Formula Games and Their Complexities [PDF]

open access: yes, 2014
Consider QBF, the Quantified Boolean Formula problem, as a combinatorial game ruleset. The problem is rephrased as determining the winner of the game where two opposing players take turns assigning values to boolean variables. In this paper, three common
Burke, Kyle
core  

IMPDH inhibition enhances cytarabine efficacy in SAMHD1‐expressing leukaemia cells via guanine nucleotide depletion

open access: yesMolecular Oncology, EarlyView.
Cytarabine is a key therapy for acute myeloid leukaemia (AML), but its efficacy is limited by the dNTPase SAMHD1, which hydrolyses its active metabolite. Screening nucleotide biosynthesis inhibitors revealed that IMPDH inhibitors selectively sensitise SAMHD1‐proficient AML cells to cytarabine.
Miriam Yagüe‐Capilla   +9 more
wiley   +1 more source

“Electromagnetic barrier” assisted dynamic spectrum access in satellite internet communication confrontation

open access: yesIET Communications, 2022
In this paper, the dynamic spectrum access is investigated in satellite internet. Firstly, to describe the confrontation characteristics of the electromagnetic environment, two opposing teams denoted as the blue team (BT) and red team (RT), are designed.
Peijie Yan   +3 more
doaj   +1 more source

Loss of IGF‐1R impairs DNA‐PKcs recruitment to chromatin leading to defective end‐joining

open access: yesMolecular Oncology, EarlyView.
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

Notes on the combinatorial game: graph Nim

open access: yesElectronic Journal of Graph Theory and Applications, 2016
The combinatorial game of Nim can be played on graphs. Over the years, various Nim-like games on graphs have been proposed and studied by N.J. Calkin et al., L.A. Erickson and M. Fukuyama.
Richard M. Low, W.H. Chan
doaj   +1 more source

Remarks on strategies in combinatorial games

open access: yesDiscrete Applied Mathematics, 1985
Viewing strategies in combinatorial games as a relation \(S\subset X\times X\) where X is the set of states (instead of a mapping \(S: X\to X)\) the authors give: 1) a very short proof of the existence of a loss-preventing strategy, 2) a proof of the existence of a winning strategy without the axiom of choice, and 3) a proof of the theorem on the value
Ales Pultr, J. Úlehla
openaire   +2 more sources

Home - About - Disclaimer - Privacy