FiGS-MoD: Feature-informed Gibbs Sampling Motif Discovery Algorithm for Mapping Human Signaling Networks

preprint OA: closed CC-BY-4.0
📄 Open PDF Full text JSON View at publisher

Abstract

Motivation Short linear motifs (SLiMs) are short sequence patterns that mediate transient protein-protein interactions, often within disordered regions of proteins. SLiMs play central roles in signaling, trafficking, and post-translational regulation, but their short length and low complexity make them difficult to identify both experimentally and computationally. Since the latest release of motif discovery tools like MEME Suite, the availability of protein-protein interaction data (e.g., BioGRID) has increased by more than fivefold, providing richer network contexts where SLiMs can be inferred from recurring patterns of interaction. Combined with recent advances in machine learning, this creates new opportunities for large-scale, high-resolution motif discovery. Results We present FiGS-MoD, a F eature- i nformed G ibbs S ampling Mo tif D iscovery algorithm with two key innovations: (i) incorporating biased sampling informed by residue-level features, including Protein Language Model (PLM) embeddings, AlphaFold2-derived disorder and solvent accessibility, and evolutionary conservation, and (ii) replacing the traditional position-specific scoring matrix (PSSM) with a Hidden Markov model (HMM) to accommodate insertions and deletions. We applied our algorithm to 12,765 sub-networks from the human interactome and provided 221,840 human SLiM predictions and quality scores as a public resource, along with the tool itself. Our method outperformed MEME in terms of recovering known motifs from the Eukaryotic Linear Motif (ELM) database and phosphosites from PhosphoGRID. Through three case studies, we further highlight the biological relevance of our results and the generalizability of the method to diverse motif classes. Availability and Implementation Source code and a predicted SLiM dataset using FiGS-MoD are freely available at https://github.com/Eric3939/FiGS-MoD
Full text 1,970 characters · extracted from oa-doi-fallback · 2 sections · click to expand

Abstract

Motivation Short linear motifs (SLiMs) are short sequence patterns that mediate transient protein-protein interactions, often within disordered regions of proteins. SLiMs play central roles in signaling, trafficking, and post-translational regulation, but their short length and low complexity make them difficult to identify both experimentally and computationally. Since the latest release of motif discovery tools like MEME Suite, the availability of protein-protein interaction data (e.g., BioGRID) has increased by more than fivefold, providing richer network contexts where SLiMs can be inferred from recurring patterns of interaction. Combined with recent advances in machine learning, this creates new opportunities for large-scale, high-resolution motif discovery.

Results

We present FiGS-MoD, a Feature-informed Gibbs Sampling Motif Discovery algorithm with two key innovations: (i) incorporating biased sampling informed by residue-level features, including Protein Language Model (PLM) embeddings, AlphaFold2-derived disorder and solvent accessibility, and evolutionary conservation, and (ii) replacing the traditional position-specific scoring matrix (PSSM) with a Hidden Markov model (HMM) to accommodate insertions and deletions. We applied our algorithm to 12,765 sub-networks from the human interactome and provided 221,840 human SLiM predictions and quality scores as a public resource, along with the tool itself. Our method outperformed MEME in terms of recovering known motifs from the Eukaryotic Linear Motif (ELM) database and phosphosites from PhosphoGRID. Through three case studies, we further highlight the biological relevance of our results and the generalizability of the method to diverse motif classes. Availability and Implementation Source code and a predicted SLiM dataset using FiGS-MoD are freely available at https://github.com/Eric3939/FiGS-MoD Competing Interest Statement The authors have declared no competing interest.

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: oa-doi-fallback

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2025) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00
unpaywall
last seen: 2026-05-22T02:00:06.705733+00:00
License: CC-BY-4.0