{'fraction_non_alphanumeric': 0.016198704103671708, 'fraction_numerical': 0.014038876889848811, 'mean_word_length': 5.01948051948052, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Computer Match Program for Paired and Unconventional Kidney Exchanges

The number of renal transplants can be increased by implementing an exchange program involving donor‐recipient pairs for whom the donors are each incompatible with their original patient but compatible with each other's patient. The number can be further increased if the exchanges are not limited to ABO incompatible pairs or combinations of two donor‐recipient pairs. However, as the number of donor‐recipient pairs willing to participate in such a program increases, there is a substantial increase in both the time taken to identify such matches and the potential for error. We have developed a computer program that accounts for ABO and HLA compatibility and is not limited to two‐way exchanges. With our database of 60 patients and 83 donors, we have been able to identify 122 two‐way and 1230 three‐way exchanges with an average run time of 30 s.