Computing the probabilities of HLA-like matching

Amir Alalouf (), Israel David () and Joseph Pliskin ()

Annals of Operations Research, 2014, vol. 221, issue 1, 33-45

Abstract: 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. Copyright Springer Science+Business Media, LLC 2014

Keywords: Transplantation; Immunology; Tissue-match; HLA; Generating functions; FFT; Polynomial multiplication (search for similar items in EconPapers)
Date: 2014
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-011-1049-2 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:221:y:2014:i:1:p:33-45:10.1007/s10479-011-1049-2

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-011-1049-2

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().