Kim Beom Seok, Kim Yu Seun, Kim Soon Il, Kim Myoung Soo, Lee Ho Yung, Kim Yong-Lim, Kim Chan Duck, Yang Chul Woo, Choi Bum Soon, Han Duck Jong, Kim Yon Su, Kim Sung Joo, Oh Ha-Young, Kim Dae Joong
Department of Internal Medicine, Institute of Kidney Desease, Yonsei University College of Medicine, Korea.
J Am Soc Nephrol. 2007 Mar;18(3):1000-6. doi: 10.1681/ASN.2006101071. Epub 2007 Jan 31.
Donor kidney exchange is an established method to overcome incompatibility of donor-recipient pairs (DRP). A computerized algorithm was devised to exchange donor kidney and was tested in a multicenter setting. The algorithm was made according to the consensus of participating centers. It makes all possible exchange combinations not only between two incompatible DRP but also circularly among three DRP and selects an optimum set of exchange combinations, considering several factors that can affect the outcome of the exchanged transplant. The algorithm was implemented as a web-based program, and matching was performed five times. Fifty-three DRP were enrolled from five transplant centers. The numbers of DRP that were enrolled in each matching were 38 (25:13), 39 (34:5), 33 (31:2), 32 (28:4), and 34 (30:4) (carryover:newcomer). The numbers of generated exchange combinations were 4:11, 3:17, 2:12, 2:3, and 2:3 (two-pair exchange:three-pair exchange), and the numbers of DRP in selected exchange combinations were six, 12, six, five, and four in each matching. The numbers of DRP with blood type O recipient or AB donor were five and one, respectively, in selected exchange combinations. Six DRP of two-pair exchange combinations and six DRP of three-pair exchange combinations underwent transplantation successfully. Computerized algorithm of donor kidney exchange was tried not only between two incompatible DRP but also circularly among three DRP. It showed that the algorithm has potential to improve the outcome of donor kidney exchange, especially for disadvantaged DRP with blood type O recipients or AB donors.
供体肾交换是一种克服供体 - 受体对(DRP)不相容性的既定方法。设计了一种计算机化算法来进行供体肾交换,并在多中心环境中进行了测试。该算法是根据参与中心的共识制定的。它不仅能生成所有可能的两个不相容DRP之间的交换组合,还能生成三个DRP之间的循环交换组合,并考虑到几个可能影响交换移植结果的因素,选择一组最佳的交换组合。该算法被实现为一个基于网络的程序,并进行了五次匹配。从五个移植中心招募了53对DRP。每次匹配中招募的DRP数量分别为38对(25:13)、39对(34:5)、33对(31:2)、32对(28:4)和34对(30:4)(结转:新来者)。生成的交换组合数量分别为4:11、3:17、2:12、2:3和2:3(两对交换:三对交换),每次匹配中选定交换组合中的DRP数量分别为6对、12对、6对、5对和4对。在选定的交换组合中,受体血型为O型或供体血型为AB型的DRP数量分别为5对和1对。两对交换组合中的6对DRP和三对交换组合中的6对DRP成功进行了移植。供体肾交换的计算机化算法不仅在两个不相容的DRP之间进行尝试,还在三个DRP之间进行循环尝试。结果表明,该算法有潜力改善供体肾交换的结果,特别是对于受体血型为O型或供体血型为AB型的弱势DRP。