Computing the probabilities of HLA-like matching

Amir Alalouf, Israel David, Joseph Pliskin

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


We present several alternative computation schemes, accompanied with appropriate software, to compute the probabilities of the (2n+1) possible match levels between the alleles in n genetic sites of a given individual, and the alleles in the same n sites of an individual who is drawn randomly from a given population. The modeling generalizes the asymmetric HLA-criterion which defines the donor-recipient immunological compatibility in kidney or bone-marrow transplantation. We discuss our algorithms by order of their run-time complexity with respect to n. We show the advantage of using computational schemes over explicit expressions even for the HLA present-day count of n=3.

Original languageEnglish
Pages (from-to)33-45
Number of pages13
JournalAnnals of Operations Research
Issue number1
StatePublished - 1 Sep 2014

Bibliographical note

Funding Information:
This research was supported by the Israel National Institute for Health Policy Research.

Publisher Copyright:
© 2012, Springer Science+Business Media, LLC.


  • FFT
  • Generating functions
  • HLA
  • Immunology
  • Polynomial multiplication
  • Tissue-match
  • Transplantation


Dive into the research topics of 'Computing the probabilities of HLA-like matching'. Together they form a unique fingerprint.

Cite this