Probabilistic variable-length segmentation of protein sequences for discriminative motif discovery (DiMotif) and sequence embedding (ProtVecX)
Ehsaneddin AsgariiD, Alice Carolyn McHardyiD, Mohammad R. K. MofradiD
Abstract
In this paper, we present peptide-pair encoding (PPE), a general-purpose probabilistic segmentation of protein sequences into commonly occurring variable-length sub-sequences. The idea of PPE segmentation is inspired by the byte-pair encoding (BPE) text compression algorithm, which has recently gained popularity in subword neural machine translation. We modify this algorithm by adding a sampling framework allowing for multiple ways of segmenting a sequence. PPE segmentation steps can be learned over a large set of protein sequences (Swiss-Prot) or even a domain-specific dataset and then applied to a set of unseen sequences. This representation can be widely used as the input to any downstream machine learning tasks in protein bioinformatics. In particular, here, we introduce this representation through protein motif discovery and protein sequence embedding. (i) DiMotif: we present DiMotif as an alignment-free discriminative motif discovery method and evaluate the method for finding protein motifs in three different settings: (1) comparison of DiMotif with two existing approaches on 20 distinct motif discovery problems which are experimentally verified, (2) classification-based approach for the motifs extracted for integrins, integrin-binding proteins, and biofilm formation, and (3) in sequence pattern searching for nuclear localization signal. The DiMotif, in general, obtained high recall scores, while having a comparable F1 score with other methods in the discovery of experimentally verified motifs. Having high recall suggests that the DiMotif can be used for short-list creation for further experimental investigations on motifs. In the classification-based evaluation, the extracted motifs could reliably detect the integrins, integrin-binding, and biofilm formation-related proteins on a reserved set of sequences with high F1 scores. (ii) ProtVecX: we extend k-mer based protein vector (ProtVec) embedding to variable-length protein embedding using PPE sub-sequences. We show that the new method of embedding can marginally outperform ProtVec in enzyme prediction as well as toxin prediction tasks. In addition, we conclude that the embeddings are beneficial in protein classification tasks when they are combined with raw k-mer features.\n\nAvailabilityImplementations of our method will be available under the Apache 2 licence at http://llp.berkeley.edu/dimotif and http://llp.berkeley.edu/protvecx.
02 /Specification & Classification
Click any tag to browse matching papers- Citations
- 80
- FWCI
- 3.48
- Field percentile
- top 6%
- Assay
- Research Focus
- Approach
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- ProtSEC: Ultrafast Protein Sequence Embedding in Complex Space Using Fast Fourier Transform
Rajan Saha Raju, Rashedul Islam·bioRxiv·Aug 17, 2025
- Protein domain embeddings for fast and accurate similarity search
Benjamin Giovanni Iovino, Haixu Tang, Yuzhen Ye·Genome ResearchPeer-reviewed·Sep 1, 2024
- Sensitive remote homology search by local alignment of small positional embeddings from protein language models
Sean R. Johnson, Meghana Peshwa, Zhiyi Sun·eLifePeer-reviewed·Mar 15, 2024
- Modeling the Language of Life - Deep Learning Protein Sequences
Michael Heinzinger, Ahmed Elnaggar, … Burkhard Rost·BMC BioinformaticsPeer-reviewed·Dec 1, 2019
- Learning Structural Motif Representations For Efficient Protein Structure Search
Yang Liu, Qing Ye, … Jian Peng·BioinformaticsPeer-reviewed·Jul 20, 2018
- Zero-shot segmentation using embeddings from a protein language model identifies functional regions in the human proteome
Ami G. Sangster, Cameron Dufault, … Alan M Moses·PLoS Computational BiologyPeer-reviewed·Nov 11, 2025