GRIMM: GRaph IMputation and matching for HLA genotypes

Abstract Motivation For over 10 years allele-level HLA matching for bone marrow registries has been performed in a probabilistic context. HLA typing technologies provide ambiguous results in that they could not distinguish among all known HLA alleles equences; therefore registries have implemented m...

Full description

Saved in:
Bibliographic Details
Published inBioinformatics Vol. 35; no. 18; pp. 3520 - 3523
Main Authors Maiers, Martin, Halagan, Michael, Gragert, Loren, Bashyal, Pradeep, Brelsford, Jason, Schneider, Joel, Lutsker, Polina, Louzoun, Yoram
Format Journal Article
LanguageEnglish
Published England Oxford University Press 15.09.2019
Online AccessGet full text
ISSN1367-4803
1367-4811
1460-2059
1367-4811
DOI10.1093/bioinformatics/btz050

Cover

Abstract Abstract Motivation For over 10 years allele-level HLA matching for bone marrow registries has been performed in a probabilistic context. HLA typing technologies provide ambiguous results in that they could not distinguish among all known HLA alleles equences; therefore registries have implemented matching algorithms that provide lists of donor and cord blood units ordered in terms of the likelihood of allele-level matching at specific HLA loci. With the growth of registry sizes, current match algorithm implementations are unable to provide match results in real time. Results We present here a novel computationally-efficient open source implementation of an HLA imputation and match algorithm using a graph database platform. Using graph traversal, the matching algorithm runtime is practically not affected by registry size. This implementation generates results that agree with consensus output on a publicly-available match algorithm cross-validation dataset. Availability and implementation The Python, Perl and Neo4j code is available at https://github.com/nmdp-bioinformatics/grimm. Supplementary information Supplementary data are available at Bioinformatics online.
AbstractList For over 10 years allele-level HLA matching for bone marrow registries has been performed in a probabilistic context. HLA typing technologies provide ambiguous results in that they could not distinguish among all known HLA alleles equences; therefore registries have implemented matching algorithms that provide lists of donor and cord blood units ordered in terms of the likelihood of allele-level matching at specific HLA loci. With the growth of registry sizes, current match algorithm implementations are unable to provide match results in real time.MOTIVATIONFor over 10 years allele-level HLA matching for bone marrow registries has been performed in a probabilistic context. HLA typing technologies provide ambiguous results in that they could not distinguish among all known HLA alleles equences; therefore registries have implemented matching algorithms that provide lists of donor and cord blood units ordered in terms of the likelihood of allele-level matching at specific HLA loci. With the growth of registry sizes, current match algorithm implementations are unable to provide match results in real time.We present here a novel computationally-efficient open source implementation of an HLA imputation and match algorithm using a graph database platform. Using graph traversal, the matching algorithm runtime is practically not affected by registry size. This implementation generates results that agree with consensus output on a publicly-available match algorithm cross-validation dataset.RESULTSWe present here a novel computationally-efficient open source implementation of an HLA imputation and match algorithm using a graph database platform. Using graph traversal, the matching algorithm runtime is practically not affected by registry size. This implementation generates results that agree with consensus output on a publicly-available match algorithm cross-validation dataset.The Python, Perl and Neo4j code is available at https://github.com/nmdp-bioinformatics/grimm.AVAILABILITY AND IMPLEMENTATIONThe Python, Perl and Neo4j code is available at https://github.com/nmdp-bioinformatics/grimm.Supplementary data are available at Bioinformatics online.SUPPLEMENTARY INFORMATIONSupplementary data are available at Bioinformatics online.
Abstract Motivation For over 10 years allele-level HLA matching for bone marrow registries has been performed in a probabilistic context. HLA typing technologies provide ambiguous results in that they could not distinguish among all known HLA alleles equences; therefore registries have implemented matching algorithms that provide lists of donor and cord blood units ordered in terms of the likelihood of allele-level matching at specific HLA loci. With the growth of registry sizes, current match algorithm implementations are unable to provide match results in real time. Results We present here a novel computationally-efficient open source implementation of an HLA imputation and match algorithm using a graph database platform. Using graph traversal, the matching algorithm runtime is practically not affected by registry size. This implementation generates results that agree with consensus output on a publicly-available match algorithm cross-validation dataset. Availability and implementation The Python, Perl and Neo4j code is available at https://github.com/nmdp-bioinformatics/grimm. Supplementary information Supplementary data are available at Bioinformatics online.
For over 10 years allele-level HLA matching for bone marrow registries has been performed in a probabilistic context. HLA typing technologies provide ambiguous results in that they could not distinguish among all known HLA allele equences; therefore registries have implemented matching algorithms that provide lists of donor and cord blood units ordered in terms of the likelihood of allele-level matching at specific HLA loci. With the growth of registry sizes, current match algorithm implementations are unable to provide match results in real time. We present here a novel computationally-efficient open source implementation of an HLA imputation and match algorithm using a graph database platform. Using graph traversal, the matching algorithm runtime is practically not affected by registry size. This implementation generates results that agree with consensus output on a publicly-available match algorithm cross-validation dataset. The Python, Perl and Neo4j code is available at https://github.com/nmdp-bioinformatics/grimm. Supplementary data are available at Bioinformatics online.
Author Maiers, Martin
Schneider, Joel
Halagan, Michael
Gragert, Loren
Lutsker, Polina
Bashyal, Pradeep
Brelsford, Jason
Louzoun, Yoram
Author_xml – sequence: 1
  givenname: Martin
  surname: Maiers
  fullname: Maiers, Martin
  organization: Department of biomedical informatics, Center for Blood and Marrow Transplant Research, Minneapolis, MN, USA
– sequence: 2
  givenname: Michael
  surname: Halagan
  fullname: Halagan, Michael
  organization: Department of biomedical informatics, Center for Blood and Marrow Transplant Research, Minneapolis, MN, USA
– sequence: 3
  givenname: Loren
  surname: Gragert
  fullname: Gragert, Loren
  organization: Department of biomedical informatics, Center for Blood and Marrow Transplant Research, Minneapolis, MN, USA
– sequence: 4
  givenname: Pradeep
  surname: Bashyal
  fullname: Bashyal, Pradeep
  organization: Department of biomedical informatics, Center for Blood and Marrow Transplant Research, Minneapolis, MN, USA
– sequence: 5
  givenname: Jason
  surname: Brelsford
  fullname: Brelsford, Jason
  organization: Department of biomedical informatics, Center for Blood and Marrow Transplant Research, Minneapolis, MN, USA
– sequence: 6
  givenname: Joel
  surname: Schneider
  fullname: Schneider, Joel
  organization: Department of biomedical informatics, Center for Blood and Marrow Transplant Research, Minneapolis, MN, USA
– sequence: 7
  givenname: Polina
  surname: Lutsker
  fullname: Lutsker, Polina
  organization: Department of Mathematics, Bar Ilan University, Ramat Gan, Israel
– sequence: 8
  givenname: Yoram
  surname: Louzoun
  fullname: Louzoun, Yoram
  email: louzouy@math.biu.ac.il
  organization: Department of Mathematics, Bar Ilan University, Ramat Gan, Israel
BackLink https://www.ncbi.nlm.nih.gov/pubmed/30689784$$D View this record in MEDLINE/PubMed
BookMark eNqNkMtOwzAQRS1URB_wCaAs2YSOX4kNK1RBW6kVUgXryHGc1iiNQ5wsytcTlIIEG1jNLM65o7ljNChdaRC6xHCDQdJpap0tc1fvVWO1n6bNO3A4QSPMIggJcDnodhrFIRNAh2js_SsAx4yxMzSkEAkZCzZC0XyzXK9vg_lGVbtgua7apgt0ZaDKLOiy9c6W26C7EyxW98HWlK45VMafo9NcFd5cHOcEvTw-PM8W4eppvpzdr0JNOTShzIDEnIMmjAFNqRIiolmkc0GJyjIMXFChIcdSMiEMMzLHHCJJDZFEU0In6LrPrWr31hrfJHvrtSkKVRrX-oTgWLKYcsE69OqItuneZElV272qD8nXrx3Ae0DXzvva5N8IhuSz0-Rnp0nfaefd_fK07UtqamWLP23obddW_zz4AbWHksk
CitedBy_id crossref_primary_10_1016_j_humimm_2021_06_010
crossref_primary_10_1111_tan_15075
crossref_primary_10_3389_fimmu_2023_1069749
crossref_primary_10_1016_j_humimm_2021_07_001
crossref_primary_10_1007_s10875_021_01071_x
crossref_primary_10_1038_s41596_023_00853_4
crossref_primary_10_3389_fgene_2024_1375352
crossref_primary_10_1111_ajt_16070
crossref_primary_10_1212_NXI_0000000000200103
crossref_primary_10_1016_j_humimm_2023_110721
Cites_doi 10.1371/journal.pcbi.1000016
10.1111/tan.12390
10.1038/bmt.2010.132
10.1093/bioinformatics/btx397
10.1111/tan.12817
10.1007/s00251-017-1040-4
10.1182/blood-2007-06-097386
10.1182/blood-2012-03-379032
10.1016/j.bbmt.2016.07.022
10.1038/75556
10.1111/j.1399-0039.2010.01518.x
10.1016/j.humimm.2007.10.009
ContentType Journal Article
Copyright The Author(s) 2019. Published by Oxford University Press. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com 2019
The Author(s) 2019. Published by Oxford University Press. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.
Copyright_xml – notice: The Author(s) 2019. Published by Oxford University Press. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com 2019
– notice: The Author(s) 2019. Published by Oxford University Press. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.
DBID AAYXX
CITATION
NPM
7X8
DOI 10.1093/bioinformatics/btz050
DatabaseName CrossRef
PubMed
MEDLINE - Academic
DatabaseTitle CrossRef
PubMed
MEDLINE - Academic
DatabaseTitleList MEDLINE - Academic

PubMed
Database_xml – sequence: 1
  dbid: NPM
  name: PubMed
  url: https://proxy.k.utb.cz/login?url=http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed
  sourceTypes: Index Database
DeliveryMethod fulltext_linktorsrc
Discipline Biology
EISSN 1460-2059
1367-4811
EndPage 3523
ExternalDocumentID 30689784
10_1093_bioinformatics_btz050
10.1093/bioinformatics/btz050
Genre Journal Article
GrantInformation_xml – fundername: US Office of Naval Research
  grantid: N00014–17–1–2388
GroupedDBID -~X
.2P
5GY
AAMVS
ABJNI
ABPTD
ACGFS
ADZXQ
ALMA_UNASSIGNED_HOLDINGS
F5P
HW0
Q5Y
RD5
TLC
TN5
TOX
WH7
---
-E4
.DC
.I3
0R~
23N
2WC
4.4
48X
53G
5WA
70D
AAIJN
AAIMJ
AAJKP
AAKPC
AAMDB
AAOGV
AAPQZ
AAPXW
AAUQX
AAVAP
AAVLN
AAYXX
ABEJV
ABEUO
ABGNP
ABIXL
ABNKS
ABPQP
ABQLI
ABWST
ABXVV
ABZBJ
ACIWK
ACPRK
ACUFI
ACUXJ
ACYTK
ADBBV
ADEYI
ADEZT
ADFTL
ADGKP
ADGZP
ADHKW
ADHZD
ADMLS
ADOCK
ADPDF
ADRDM
ADRTK
ADVEK
ADYVW
ADZTZ
AECKG
AEGPL
AEJOX
AEKKA
AEKSI
AELWJ
AEMDU
AENEX
AENZO
AEPUE
AETBJ
AEWNT
AFFZL
AFGWE
AFIYH
AFOFC
AFRAH
AGINJ
AGKEF
AGQXC
AGSYK
AHMBA
AHXPO
AIJHB
AJEEA
AJEUX
AKHUL
AKWXX
ALTZX
ALUQC
AMNDL
APIBT
APWMN
ARIXL
ASPBG
AVWKF
AXUDD
AYOIW
AZVOD
BAWUL
BAYMD
BHONS
BQDIO
BQUQU
BSWAC
BTQHN
C45
CDBKE
CITATION
CS3
CZ4
DAKXR
DIK
DILTD
DU5
D~K
EBD
EBS
EE~
EMOBN
F9B
FEDTE
FHSFR
FLIZI
FLUFQ
FOEOM
FQBLK
GAUVT
GJXCC
GROUPED_DOAJ
GX1
H13
H5~
HAR
HZ~
IOX
J21
JXSIZ
KAQDR
KOP
KQ8
KSI
KSN
M-Z
MK~
ML0
N9A
NGC
NLBLG
NMDNZ
NOMLY
NU-
O9-
OAWHX
ODMLO
OJQWA
OK1
OVD
OVEED
P2P
PAFKI
PEELM
PQQKQ
Q1.
R44
RNS
ROL
RPM
RUSNO
RW1
RXO
SV3
TEORI
TJP
TR2
W8F
WOQ
X7H
YAYTL
YKOAZ
YXANX
ZKX
~91
~KM
ADRIX
AFXEN
BCRHZ
EJD
M49
NPM
ROX
7X8
ID FETCH-LOGICAL-c350t-9d027550c24403b3a8863d6cf832add105838c0f199488e4e9f150693e292c323
IEDL.DBID TOX
ISSN 1367-4803
1367-4811
IngestDate Fri Jul 11 15:12:30 EDT 2025
Wed Feb 19 02:33:54 EST 2025
Thu Apr 24 23:02:46 EDT 2025
Tue Jul 01 02:33:48 EDT 2025
Wed Apr 02 07:04:42 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 18
Language English
License This article is published and distributed under the terms of the Oxford University Press, Standard Journals Publication Model (https://academic.oup.com/journals/pages/open_access/funder_policies/chorus/standard_publication_model)
https://academic.oup.com/journals/pages/open_access/funder_policies/chorus/standard_publication_model
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c350t-9d027550c24403b3a8863d6cf832add105838c0f199488e4e9f150693e292c323
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
PMID 30689784
PQID 2179473584
PQPubID 23479
PageCount 4
ParticipantIDs proquest_miscellaneous_2179473584
pubmed_primary_30689784
crossref_primary_10_1093_bioinformatics_btz050
crossref_citationtrail_10_1093_bioinformatics_btz050
oup_primary_10_1093_bioinformatics_btz050
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2019-09-15
PublicationDateYYYYMMDD 2019-09-15
PublicationDate_xml – month: 09
  year: 2019
  text: 2019-09-15
  day: 15
PublicationDecade 2010
PublicationPlace England
PublicationPlace_xml – name: England
PublicationTitle Bioinformatics
PublicationTitleAlternate Bioinformatics
PublicationYear 2019
Publisher Oxford University Press
Publisher_xml – name: Oxford University Press
References Dehn (2023013108062894600_btz050-B4) 2016; 22
Spellman (2023013108062894600_btz050-B12) 2012; 120
Lee (2023013108062894600_btz050-B7) 2007; 110
Madbouly (2023013108062894600_btz050-B10) 2014; 84
Bochtler (2023013108062894600_btz050-B2) 2016; 87
Bochtler (2023013108062894600_btz050-B3) 2011; 46
Ashburner (2023013108062894600_btz050-B1) 2000; 25
Listgarten (2023013108062894600_btz050-B8) 2008; 4
Mughal (2023013108062894600_btz050-B11) 2017; 33
Eberhard (2023013108062894600_btz050-B5) 2010; 76
Kollman (2023013108062894600_btz050-B6) 2007; 68
Louzoun (2023013108062894600_btz050-B9) 2018; 70
References_xml – volume: 4
  start-page: e1000016
  year: 2008
  ident: 2023013108062894600_btz050-B8
  article-title: Statistical resolution of ambiguous HLA typing data
  publication-title: PLoS Computat. Biol.
  doi: 10.1371/journal.pcbi.1000016
– volume: 84
  start-page: 285
  year: 2014
  ident: 2023013108062894600_btz050-B10
  article-title: Validation of statistical imputation of allele-level multilocus phased genotypes from ambiguous HLA assignments
  publication-title: Tissue Antigens
  doi: 10.1111/tan.12390
– volume: 46
  start-page: 338
  year: 2011
  ident: 2023013108062894600_btz050-B3
  article-title: World Marrow Donor Association framework for the implementation of HLA matching programs in hematopoietic stem cell donor registries and cord blood banks
  publication-title: Bone Marrow Transplant.
  doi: 10.1038/bmt.2010.132
– volume: 33
  start-page: 3317
  year: 2017
  ident: 2023013108062894600_btz050-B11
  article-title: Pheno4J: a gene to phenotype graph database
  publication-title: Bioinformatics
  doi: 10.1093/bioinformatics/btx397
– volume: 87
  start-page: 439
  year: 2016
  ident: 2023013108062894600_btz050-B2
  article-title: A comparative reference study for the validation of HLA-matching algorithms in the search for allogeneic hematopoietic stem cell donors and cord blood units
  publication-title: HLA
  doi: 10.1111/tan.12817
– volume: 70
  start-page: 279
  year: 2018
  ident: 2023013108062894600_btz050-B9
  article-title: Modeling coverage gaps in haplotype frequencies via Bayesian inference to improve stem cell donor selection
  publication-title: Immunogenetics
  doi: 10.1007/s00251-017-1040-4
– volume: 110
  start-page: 4576
  year: 2007
  ident: 2023013108062894600_btz050-B7
  article-title: High-resolution donor-recipient HLA matching contributes to the success of unrelated donor marrow transplantation
  publication-title: Blood
  doi: 10.1182/blood-2007-06-097386
– volume: 120
  start-page: 259
  year: 2012
  ident: 2023013108062894600_btz050-B12
  article-title: A perspective on the selection of unrelated donors and cord blood units for transplantation
  publication-title: Blood
  doi: 10.1182/blood-2012-03-379032
– volume: 22
  start-page: 2038
  year: 2016
  ident: 2023013108062894600_btz050-B4
  article-title: HapLogic: a predictive human leukocyte antigen–matching algorithm to enhance rapid identification of the optimal unrelated hematopoietic stem cell sources for transplantation
  publication-title: Biol. Blood Marrow Transplant.
  doi: 10.1016/j.bbmt.2016.07.022
– volume: 25
  start-page: 25
  year: 2000
  ident: 2023013108062894600_btz050-B1
  article-title: Gene Ontology: tool for the unification of biology
  publication-title: Nat. Genet.
  doi: 10.1038/75556
– volume: 76
  start-page: 352
  year: 2010
  ident: 2023013108062894600_btz050-B5
  article-title: Estimating unbiased haplotype frequencies from stem cell donor samples typed at heterogeneous resolutions: a practical study based on over 1 million German donors
  publication-title: Tissue Antigens
  doi: 10.1111/j.1399-0039.2010.01518.x
– volume: 68
  start-page: 950
  year: 2007
  ident: 2023013108062894600_btz050-B6
  article-title: Estimation of HLA-A,-B,-DRB1 haplotype frequencies using mixed resolution data from a national registry with selective retyping of volunteers
  publication-title: Hum. Immunol.
  doi: 10.1016/j.humimm.2007.10.009
SSID ssj0051444
ssj0005056
Score 2.3870406
Snippet Abstract Motivation For over 10 years allele-level HLA matching for bone marrow registries has been performed in a probabilistic context. HLA typing...
For over 10 years allele-level HLA matching for bone marrow registries has been performed in a probabilistic context. HLA typing technologies provide ambiguous...
For over 10 years allele-level HLA matching for bone marrow registries has been performed in a probabilistic context. HLA typing technologies provide ambiguous...
SourceID proquest
pubmed
crossref
oup
SourceType Aggregation Database
Index Database
Enrichment Source
Publisher
StartPage 3520
Title GRIMM: GRaph IMputation and matching for HLA genotypes
URI https://www.ncbi.nlm.nih.gov/pubmed/30689784
https://www.proquest.com/docview/2179473584
Volume 35
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAFT
  databaseName: Open Access Digital Library
  customDbUrl:
  eissn: 1460-2059
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0005056
  issn: 1367-4803
  databaseCode: KQ8
  dateStart: 19960101
  isFulltext: true
  titleUrlDefault: http://grweb.coalliance.org/oadl/oadl.html
  providerName: Colorado Alliance of Research Libraries
– providerCode: PRVEBS
  databaseName: Inspec with Full Text
  customDbUrl:
  eissn: 1460-2059
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0005056
  issn: 1367-4803
  databaseCode: ADMLS
  dateStart: 19980101
  isFulltext: true
  titleUrlDefault: https://www.ebsco.com/products/research-databases/inspec-full-text
  providerName: EBSCOhost
– providerCode: PRVBFR
  databaseName: Free Medical Journals
  customDbUrl:
  eissn: 1460-2059
  dateEnd: 20241102
  omitProxy: true
  ssIdentifier: ssj0005056
  issn: 1367-4803
  databaseCode: DIK
  dateStart: 19960101
  isFulltext: true
  titleUrlDefault: http://www.freemedicaljournals.com
  providerName: Flying Publisher
– providerCode: PRVFQY
  databaseName: GFMER Free Medical Journals
  customDbUrl:
  eissn: 1460-2059
  dateEnd: 20241102
  omitProxy: true
  ssIdentifier: ssj0005056
  issn: 1367-4803
  databaseCode: GX1
  dateStart: 19960101
  isFulltext: true
  titleUrlDefault: http://www.gfmer.ch/Medical_journals/Free_medical.php
  providerName: Geneva Foundation for Medical Education and Research
– providerCode: PRVAQN
  databaseName: PubMed Central
  customDbUrl:
  eissn: 1460-2059
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0005056
  issn: 1367-4803
  databaseCode: RPM
  dateStart: 20070101
  isFulltext: true
  titleUrlDefault: https://www.ncbi.nlm.nih.gov/pmc/
  providerName: National Library of Medicine
– providerCode: PRVOVD
  databaseName: Journals@Ovid LWW All Open Access Journal Collection Rolling
  customDbUrl:
  eissn: 1460-2059
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0005056
  issn: 1367-4803
  databaseCode: OVEED
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: http://ovidsp.ovid.com/
  providerName: Ovid
– providerCode: PRVASL
  databaseName: Oxford Journals Open Access Collection
  customDbUrl:
  eissn: 1460-2059
  dateEnd: 20220930
  omitProxy: true
  ssIdentifier: ssj0005056
  issn: 1367-4803
  databaseCode: TOX
  dateStart: 19850101
  isFulltext: true
  titleUrlDefault: https://academic.oup.com/journals/
  providerName: Oxford University Press
– providerCode: PRVASL
  databaseName: Oxford Journals Open Access Collection
  customDbUrl:
  eissn: 1460-2059
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0005056
  issn: 1367-4803
  databaseCode: TOX
  dateStart: 19850101
  isFulltext: true
  titleUrlDefault: https://academic.oup.com/journals/
  providerName: Oxford University Press
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwEA9DEHwRv51fRPDFh7qsl7aJb0PchziFscHeStMmKEg3XPegf72XpptMEfWx0FzKXZL7pXf3O0Iu0CdkRhub3S-UxzPpe4lqao9xhB8yS2WWlAmyD2F3xO_GwbhG2KIW5msIX0JDPU8qElFLXNxQxTsrL-koy7YsGD6OP3M6mGWGcQ-IBLhraWuZvQWDRf3OTyJXPNNKtds30Fk6n_YW2axQI205M2-Tms53yLrrI_m2S8LOoNfvX9POIJk-0V5_OncBdprkGcXZy3xJil9Cu_ctamlZ7Z_X2R4ZtW-HN12vaojgpRCwwpOZDTIGLEWfzEBBIkQIWZga3JZ4TiFUEiBSZizfrxCaa2ksgaAE7Us_BR_2yVo-yfUhoTwwKlIBmCACroyWCFwEhAZ8ZiIV8jrhC2XEacUWbptWvMQuag3xqg5jp8M6uVoOmzq6jN8GXKKm__ru-cIeMW4CG9lIcj2Zz2LfHisRIJiqkwNnqKVIvBMJvCrzo3_MdEw2EBiVuWTN4ISsFa9zfYrgo1Bn5YL7AJPl2B4
linkProvider Oxford University Press
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=GRIMM%3A+GRaph+IMputation+and+Matching+for+HLA+Genotypes&rft.jtitle=Bioinformatics+%28Oxford%2C+England%29&rft.au=Maiers%2C+Martin&rft.au=Halagan%2C+Michael&rft.au=Gragert%2C+Loren&rft.au=Bashyal%2C+Pradeep&rft.date=2019-09-15&rft.eissn=1367-4811&rft_id=info:doi/10.1093%2Fbioinformatics%2Fbtz050&rft_id=info%3Apmid%2F30689784&rft.externalDocID=30689784
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1367-4803&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1367-4803&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1367-4803&client=summon