ArticleMethods in molecular biology (Clifton, N.J.)2024
Graph-Based Imputation Methods and Their Applications to Single Donors and Families.
Article in Methods in molecular biology (Clifton, N.J.), 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
2 citing papers in PubMed.
- GRIMM-II: A two-stage real-time algorithm for nine-locus HLA imputation and matching with up to three mismatches.Human immunology · 2026Article
- GRIMM-II: A Two-Stage Real-Time Algorithm for Nine-Locus HLA Imputation and Matching with Up to Three Mismatches.bioRxiv : the preprint server for biology · 2026Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
The outcome of Hematopoietic Stem Cell (HSCT) and organ transplant is strongly affected by the matching of the HLA alleles of the donor and the recipient. However, donors and sometimes recipients are often typed at low resolution, with some alleles either missing or ambiguous. Thus, imputation methods are required to detect the most probably high-resolution HLA haplotypes consistent with a typing. Such imputation algorithms require predefined haplotype frequencies. As such, the phasing of the typing is required for both imputation and frequency generation.We have developed a new approach to HLA haplotype and genotype imputation, where first all candidate phases of a typing are explicated, and then the ambiguity within each phase is solved. This ambiguity is solved through a graph structure of all partial haplotypes and the haplotypes consistent with them.This phasing approach was used to produce an imputation algorithm (GRIMM-Graph Imputation and Matching). GRIMM was then combined with the possibility of combining information from multiple races to produce MR-GRIMM (Multi-Race GRIMM). When family information is available, the phasing of each family member can be restricted by the others. We propose GRAMM (GRaph-bAsed faMily iMputation) to phase alleles in family pedigree HLA typing data and in mother-cord blood unit pairs. Finally, we combined MR-GRIMM with an expectation-maximization (EM) algorithm to estimate haplotype frequencies sharing information between races to produce MR-GRIMME (MR-GRIMM EM).We have shown that these algorithms naturally combine information between races and family members. The accuracy of each of these algorithms is significantly better than its current parallel methods. MR-GRIMM leads to high accuracy in matching predictions. GRAMM better imputes family members than either MR-GRIMM or any existing algorithm and has practically no phasing errors. MR-GRIMME obtains a higher likelihood than existing algorithms.MR-GRIMM, MR-GRIMME, and GRAMM are available as servers or through stand-alone versions in GITHUB and PyPi, as detailed in the appropriate sections.
Indexed as
Identifiers
38907899What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.