paper-with-me

Papers

Kinetic Monte Carlo study of the type1/type 2 choice in apoptosis elucidates selective killing of cancer cells under death ligand induction

2015-01-30

Death ligand mediated apoptotic activation is a mode of programmed cell death that is widely used in cellular and physiological situations. Interest in studying death ligand induced apoptosis has increased due to the promising role of recombinant soluble forms of death ligands (mainly recombinant TRAIL) in anti-cancer therapy. A clear elucidation of how death ligands activate the type 1 and type 2 apoptotic pathways in healthy and cancer cells may help develop better chemotherapeutic strategies. In this work, we use kinetic Monte Carlo simulations to address the problem of type 1/ type 2 choice in death ligand mediated apoptosis of cancer cells. Our study provides insights into the activation of membrane proximal death module that results from complex interplay between death and decoy receptors. Relative abundance of death and decoy receptors was shown to be a key parameter for activation of the initiator caspases in the membrane module. Increased concentration of death ligands frequently increased the type 1 activation fraction in cancer cells, and, in certain cases changes the signaling phenotype from type 2 to type 1. Results of this study also indicate that inherent differences between cancer and healthy cells, such as in the membrane module, may allow robust activation of cancer cell apoptosis by death ligand induction. At the same time, large cell-to-cell variability through the type 2 pathway was shown to provide protection for healthy cells. Such elucidation of selective activation of apoptosis in cancer cells addresses a key question in cancer biology and cancer therapy.

📄 PDF Abstract BibTeX arXiv:1501.07854

Code (0)

등록된 구현이 없습니다.

Tasks

Vocal Bursts Type Prediction

Similar Papers 제목 키워드 기반

Regime-Switching Langevin Monte Carlo Algorithms

2025-08-31 · Xiaoyu Wang, Yingli Wang, Lingjiong Zhu arxiv

Langevin Monte Carlo (LMC) algorithms are popular Markov Chain Monte Carlo (MCMC) methods to sample a target probability distribution, which arises in many applications in machine learning. Inspired by regime-switching s…

Bounding the error of discretized Langevin algorithms for non-strongly log-concave targets

2019-06-20 · Arnak S. Dalalyan, Avetik Karagulyan, Lionel Riou-Durand

In this paper, we provide non-asymptotic upper bounds on the error of sampling from a target density using three schemes of discretized Langevin diffusions. The first scheme is the Langevin Monte Carlo (LMC) algorithm, t…

Context-aware learning of hierarchies of low-fidelity models for multi-fidelity uncertainty quantification

2022-11-20 · Ionut-Gabriel Farcas, Benjamin Peherstorfer, Tobias Neckel, Frank Jenko 외

Multi-fidelity Monte Carlo methods leverage low-fidelity and surrogate models for variance reduction to make tractable uncertainty quantification even when numerically simulating the physical systems of interest with hig…

Uncertainty Quantification

Randomized Runge-Kutta-Nyström Methods for Unadjusted Hamiltonian and Kinetic Langevin Monte Carlo

2023-10-11 · Nawaf Bou-Rabee, Tore Selland Kleppe

We introduce $5/2$- and $7/2$-order $L^2$-accurate randomized Runge-Kutta-Nystr\"{o}m methods, tailored for approximating Hamiltonian flows within non-reversible Markov chain Monte Carlo samplers, such as unadjusted Hami…

Population pharmacokinetics and dosing regimen optimization of tacrolimus in Chinese lung transplant recipients

2020-02-01 · Xiaojun Cai, Huizhu Song, Zheng Jiao, Hang Yang 외

We aimed to develop a population pharmacokinetic model of tacrolimus in Chinese lung transplant recipients, and propose model based dosing regimens for individualized treatment. We obtained 807 tacrolimus whole blood con…