EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

GAMMA: gap-aware motif mining under incomplete labeling with applications to MHC motifs

Xinyi Tang, Ran Liu iD

Bioinformatics · 2026

DOI: 10.1093/bioinformatics/btag014 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Bioinformatics, 2026. Verfasst von Xinyi Tang und 1 weiteren Autor:innen. Beteiligte Einrichtung: Department of Mathematics, Statistics and Insurance, The Hang Seng University of Hong Kong, Shatin, Hong Kong SAR, China. Hauptthemen laut MEDLINE: Algorithms, Computational Biology, Histocompatibility Antigens Class I, Data Mining. Die Arbeit nennt 29 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Research Funds of Beijing Normal University.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Motivation Sequence motif identification is crucial for understanding molecular recognition, particularly in immune responses involving peptide binding to major histocompatibility complex (MHC) Class I molecules for antigen presentation to T cells. Traditionally, MHC Class I binding motifs are assumed to be contiguous and span nine amino acids. However, structural evidence suggests that binding may involve nonadjacent residues, challenging the assumptions of existing methods. Results In this study, we propose Gap-Aware Motif Mining Algorithm (GAMMA), a probabilistic framework designed to identify noncontiguous motifs under conditions of incomplete labeling. GAMMA employs Bayesian inference with Markov chain Monte Carlo sampling to jointly estimate motif parameters, binding locations, and the relative spacing between binding positions. Through extensive simulations and real-world applications to MHC Class I peptide datasets, GAMMA outperforms existing motif discovery tools such as GLAM2 in accurately localizing binding residues and identifying the underlying motifs. Notably, our results suggest that the true number of binding residues may be eight, fewer than the commonly assumed nine. In addition, for longer peptides, the model captures increased flexibility in the central region, consistent with structural observations that peptides may bulge in the middle. Availability and implementation The raw data and the source codes are available on GitHub (https://github.com/RanLIUaca/GAMMAmotif).

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

AlgorithmsComputational BiologyHistocompatibility Antigens Class IData MiningMajor Histocompatibility ComplexSequence Analysis, ProteinAmino Acid MotifsBinding SitesPeptidesImmunoinformaticsBayes TheoremProtein BindingMarkov Chains

Substanzen

PeptidesHistocompatibility Antigens Class I

Autor:innen und Institutionen

  • Department of Mathematics, Statistics and Insurance, The Hang Seng University of Hong Kong, Shatin, Hong Kong SAR, China.
  • Department of Statistics, The Chinese University of Hong Kong, Shatin, Hong Kong SAR, China.
  • Department of Statistics, Faculty of Arts and Sciences, Beijing Normal University, Zhuhai 519087, China.

ORCID-Profile: Ran Liu

Förderung

  • Research Funds of Beijing Normal University

Zitieren

APA

Tang, X., & Liu, R. (2026). GAMMA: gap-aware motif mining under incomplete labeling with applications to MHC motifs. Bioinformatics. https://doi.org/10.1093/bioinformatics/btag014

Vancouver

Tang X, Liu R. GAMMA: gap-aware motif mining under incomplete labeling with applications to MHC motifs. Bioinformatics. 2026. doi:10.1093/bioinformatics/btag014

BibTeX
@article{Tang2026,
  author = {Tang, Xinyi and Liu, Ran},
  title = {GAMMA: gap-aware motif mining under incomplete labeling with applications to MHC motifs},
  journal = {Bioinformatics},
  year = {2026},
  doi = {10.1093/bioinformatics/btag014}
}
Kostenlos starten →