目的探讨分化簇47(cluster of differentiation 47,CD47)与接受程序性死亡蛋白-1(programmed cell death protein 1,PD-1)/程序性死亡配体-1(programmed cell death ligand,PD-L1)抑制剂一线治疗的晚期非小细胞肺癌(Non-small cell lung...目的探讨分化簇47(cluster of differentiation 47,CD47)与接受程序性死亡蛋白-1(programmed cell death protein 1,PD-1)/程序性死亡配体-1(programmed cell death ligand,PD-L1)抑制剂一线治疗的晚期非小细胞肺癌(Non-small cell lung cancer,NSCLC)患者疗效及预后的相关性。方法收集2021年1月-2023年12月经湖南省邵阳市中心医院确诊为IIIB-IV期NSCLC且接受PD-1/PD-L1抑制剂一线治疗的116例患者的资料,获取患者的CD47蛋白表达情况并分析其与免疫治疗后疗效和预后的相关性。结果CD47阴性表达组患者的疾病控制率(disease control rate,DCR)高于阳性表达组(P=0.045)。在单因素生存分析中,CD47蛋白阴性表达患者的PFS优于CD47阳性表达组(P=0.002)。结论CD47蛋白阴性表达与晚期NSCLC患者接受免疫治疗后的疗效更好有关。展开更多
We assign vertex v of G a list L(v)which L(v)∈2^(N)and N is the set of positive integers.A graph G is k-L(p,1)-choosable if G has a mappingφ:φ(v)2 L(v)which|L(v)|≥k for every v 2 V(G)such that for any two vertices...We assign vertex v of G a list L(v)which L(v)∈2^(N)and N is the set of positive integers.A graph G is k-L(p,1)-choosable if G has a mappingφ:φ(v)2 L(v)which|L(v)|≥k for every v 2 V(G)such that for any two vertices u and w,|φ(u)-φ(w)|≥p when they are adjacent,and|φ(u)-φ(w)|≥1 when they are at distance 2.In this paper,we proved that:(1)for every planar graph with g(G)≥5 andΔ≥5,G is 12-L(1,1)-choosable.(2)for every planar graph with g(G)≥6 andΔ≥15,G is(Δ+6)-L(2,1)-choosable.展开更多
文摘目的探讨分化簇47(cluster of differentiation 47,CD47)与接受程序性死亡蛋白-1(programmed cell death protein 1,PD-1)/程序性死亡配体-1(programmed cell death ligand,PD-L1)抑制剂一线治疗的晚期非小细胞肺癌(Non-small cell lung cancer,NSCLC)患者疗效及预后的相关性。方法收集2021年1月-2023年12月经湖南省邵阳市中心医院确诊为IIIB-IV期NSCLC且接受PD-1/PD-L1抑制剂一线治疗的116例患者的资料,获取患者的CD47蛋白表达情况并分析其与免疫治疗后疗效和预后的相关性。结果CD47阴性表达组患者的疾病控制率(disease control rate,DCR)高于阳性表达组(P=0.045)。在单因素生存分析中,CD47蛋白阴性表达患者的PFS优于CD47阳性表达组(P=0.002)。结论CD47蛋白阴性表达与晚期NSCLC患者接受免疫治疗后的疗效更好有关。
文摘We assign vertex v of G a list L(v)which L(v)∈2^(N)and N is the set of positive integers.A graph G is k-L(p,1)-choosable if G has a mappingφ:φ(v)2 L(v)which|L(v)|≥k for every v 2 V(G)such that for any two vertices u and w,|φ(u)-φ(w)|≥p when they are adjacent,and|φ(u)-φ(w)|≥1 when they are at distance 2.In this paper,we proved that:(1)for every planar graph with g(G)≥5 andΔ≥5,G is 12-L(1,1)-choosable.(2)for every planar graph with g(G)≥6 andΔ≥15,G is(Δ+6)-L(2,1)-choosable.
