4.5 Article

The optimal chain length for kidney paired exchanges: an analysis of the Dutch program

期刊

TRANSPLANT INTERNATIONAL
卷 23, 期 11, 页码 1120-1125

出版社

WILEY-BLACKWELL
DOI: 10.1111/j.1432-2277.2010.01114.x

关键词

algorithm; exchange program; kidney transplantation; living donation

向作者/读者索取更多资源

P>Living donor kidney exchange programs offer incompatible donor-recipient pairs the opportunity to be transplanted. To increase the number of these transplants, we examined in our actual donor-recipient couples how to reach the maximum number of matches by using different chain lengths. We performed 20 match procedures in which we constructed four different chain lengths: two, up to three, up to four and unlimited. The actual inflow and outflow of donor-recipient couples for each run were taken into consideration in this analysis. The total number of matched pairs increased from 148 pairs for only two-way exchanges to 168 for three-way exchanges. When a chain length of 4 was allowed five extra couples could be matched over a period of 5 years. Unlimited chain length did not significantly affect the results. The optimal chain length for living donor kidney exchange programs is 3. Longer chains with their inherent logistic burden do not lead to significantly more transplants.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据