Correlation of HLA-G expression with CMV active infection following kidney transplantation

Objective To determine the correlation of human leukocyte antigen - G ( HLA - G) expression with CMV active infection after kidney transplantation. Methods A total of 215 first - time kidney transplantation recipients in one transplantation center were divided into CMV ( + ) group and CMV ( - ) group according to

HLA-G expression in the peripheral blood of live kidney transplant recipients

Background The human leukocyte antigen-G （HLA-G） has been considered to be an important tolerogeneic molecule playing an essential role in maternal-fetal tolerance, upregulated in the context of transplantation, malignancy, and inflammation, and has been correlated with various clinical outcomes. The aim of this study was to investigate the clinical relevance of the expression of membrane HLA-G （mHLA-G）, intracellular HLA-G （iHLA-G）, and soluble HLA-G （sHLA-G） in the peripheral blood of live kidney transplant recipients. Methods We compared the expression of the three HLA-G isoforms in three groups, healthy donors （n=20）, recipients with acute rejection （n=19）, and functioning transplants （n=30）. Flow cytometry was used to detect the expression of mHLA-G and iHLA-G in the T lymphocytes of peripheral blood from subjects in the three groups. Enzyme-linked immunosorbent assays were used to detect sHLA-G in the plasma from the three groups. Results There were no significant differences in mHLA-G and intracellular HLA-G among the three groups, but the sHLA-G plasma level was higher in the functioning group than in the acute rejection or healthy group. We found a subset of CD4＊HLA-G~ and CD8~HLA-G＋T lymphocytes with low rates of mHLA-G expression in the peripheral blood of kidney transplantation recipients. Intracellular expression of HLA-G was detected in T lymphocytes. However, there was no correlation between acute rejection and the mHLA-G or intracellular HLA-G expression. Conclusion sHLA-G was the major isoform in the peripheral blood of live kidney transplant recipients and high sHLA-G levels were associated with allograft acceptance.

The parametric complexity of bisimulation equivalence of normed pushdown automata

Deciding bisimulation equivalence of two normed pushdown automata is one of the most fundamental problems in formal verification.The problem is proven to be ACKER-MANN-complete recently.Both the upper bound and the lower bound results indicate that the number of control states is an important parameter.In this paper,we study the parametric complexity of this problem.We refine previous results in two aspects.First,we prove that the bisimulation equivalence of normed PDA with two states is EXPTIME-hard.Second,we prove that the bisimulation equivalence of normed PDA with d states is in F_(d+3),which improves the best known upper bound F_(d+4) of this problem.