期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
RIP1-dependent linear and nonlinear recruitments of caspase-8 and RIP3 respectively to necrosome specify distinct cell death outcomes 被引量:6
1
作者 Xiang Li Chuan-Qi Zhong +14 位作者 Rui Wu Xiaozheng Xu Zhang-Hua Yang shaowei cai Xiurong Wu Xin Chen Zhiyong Yin Qingzu He Dianjie Li Fei Xu Yihua Yan Hong Qi Changchuan Xie Jianwei Shuai Jiahuai Han 《Protein & Cell》 SCIE CSCD 2021年第11期858-876,共19页
There remains a significant gap in our quantitative understanding of crosstalk between apoptosis and necroptosis pathways.By employing the SWATH-MS technique,we quantified absolute amounts of up to thousands of protei... There remains a significant gap in our quantitative understanding of crosstalk between apoptosis and necroptosis pathways.By employing the SWATH-MS technique,we quantified absolute amounts of up to thousands of proteins in dynamic assembling/de-assembling of TNF signaling complexes.Combining SWATH-MS-based network modeling and experimental validation,we found that when RIP1 level is below~1000 molecules/cell(mpc),the cell solely undergoes TRADD-dependent apoptosis.When RIP1 is above~1000 mpc,pro-caspase-8 and RIP3 are recruited to necrosome respectively with linear and nonlinear dependence on RIP1 amount,which well explains the co-occurrence of apoptosis and necroptosis and the paradoxical obser-vations that RIP1 is required for necroptosis but its increase down-regulates necroptosis.Higher amount of RIP1(>~46,000 mpc)suppresses apoptosis,leading to necroptosis alone.The relation between RIP1 level and occurrence of necroptosis or total cell death is biphasic.Our study provides a resource for encoding the com-plexity of TNF signaling and a quantitative picture how distinct dynamic interplay among proteins function as basis sets in signaling complexes,enabling RIP1 to play diverse roles in governing cell fate decisions. 展开更多
关键词 necrosome protein complexes quantification RIP1 SWATH-MS network modeling
原文传递
Empirical investigation of stochastic local search for maximum satisfiability 被引量:3
2
作者 Yi CHU Chuan LUO +1 位作者 shaowei cai Haihang YOU 《Frontiers of Computer Science》 SCIE EI CSCD 2019年第1期86-98,共13页
The maximum satisfiability (MAX-SAT)problem is an important NP-hard problem in theory,and has a broad range of applications in practice.Stochastic local search (SLS)is becoming an increasingly popular method for solvi... The maximum satisfiability (MAX-SAT)problem is an important NP-hard problem in theory,and has a broad range of applications in practice.Stochastic local search (SLS)is becoming an increasingly popular method for solving MAX-SAT.Recently,a powerful SLS algorithm called CCLS shows efficiency on solving random and crafted MAX-SAT instances.However,the performance of CCLS on solving industrial MAX-SAT instances lags far behind.In this paper,we focus on experimentally analyzing the performance of SLS algorithms for solving industrial MAXSAT instances.First,we conduct experiments to analyze why CCLS performs poor on industrial instances.Then we propose a new strategy called additive BMS (Best from Multiple Selections)to ease the serious issue.By integrating CCLS and additive BMS,we develop a new SLS algorithm for MAXSAT called CCABMS,and related experiments indicate the efficiency of CCABMS.Also,we experimentally analyze the effectiveness of initialization methods on SLS algorithms for MAX-SAT,and combine an effective initialization method with CCABMS,resulting in an enhanced algorithm.Experimental results show that our enhanced algorithm performs better than its state-of-the-art SLS competitors on a large number of industrial MAX-SAT instances. 展开更多
关键词 empirical investigation STOCHASTIC local SEARCH MAXIMUM SATISFIABILITY industrial instances ADDITIVE BMS
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部