Related Experiment Video
Updated: Jul 17, 2026

Computational Prediction of Amino Acid Preferences of Potentially Multispecific Peptide-Binding Domains Involved in Protein-Protein Interactions
Published on: January 26, 2024
An efficient, versatile and scalable pattern growth approach to mine frequent patterns in unaligned protein sequences
Kai Ye1, Walter A Kosters, Adriaan P Ijzerman
1Division of Medicinal Chemistry, Leiden/Amsterdam Center for Drug Research and Leiden Institute of Advanced Computer Science, Leiden University, Leiden, The Netherlands. k.ye@lacdr.leidenuniv.nl
A new pattern growth algorithm offers more efficient and versatile pattern discovery in protein sequences than existing methods like PRATT2 and TEIRESIAS. This approach enhances the identification of frequent patterns, aiding in the analysis of complex biological data.
Area of Science:
- Bioinformatics
- Computational Biology
- Genomics
Background:
- Protein sequence pattern discovery traditionally relies on computationally intensive multiple sequence alignments (MSA).
- Existing algorithms like PRATT2 and TEIRESIAS identify patterns from unaligned sequences but have limitations.
- Deviating protein sequences pose challenges for manual alignment and pattern identification.
Purpose of the Study:
- To develop a novel, more efficient, and functional algorithm for discovering patterns in unaligned biological sequences.
- To compare the new algorithm's performance against PRATT2 and TEIRESIAS in terms of efficiency, completeness, and pattern diversity.
- To explore applications of the new algorithm in analyzing G protein-coupled receptors.
Main Methods:
- Design and implementation of six pattern growth algorithms.
- Mining three distinct pattern types from one or two datasets.
- Comparative analysis with PRATT2 and TEIRESIAS.
Main Results:
- The new pattern growth approach is faster and handles larger datasets than PRATT2.
- It can identify type III patterns, a capability lacking in PRATT2.
- The algorithm shows comparable performance to TEIRESIAS for type I patterns and offers additional functionality for type II and type III patterns, plus discriminating patterns.
Conclusions:
- The proposed pattern growth algorithm provides a superior alternative to PRATT2 and TEIRESIAS for protein sequence pattern discovery.
- Its enhanced efficiency and functionality facilitate the analysis of complex sequence data, including G protein-coupled receptors.
- The source code is available for broader research application.
Related Concept Videos
Conservation of Protein Domains Over Different Proteins
A limited set of protein domains often duplicate and recombine during evolution. These domains can be organized in different combinations to form...
Protein Families
Protein-protein Interfaces
Protein Networks
These interactions can be represented through maps depicting protein-protein interaction networks, represented as nodes and edges. Nodes are circles that are representative of a protein,...
Conservation of Protein Domains
A limited set of protein domains often duplicate and recombine during evolution. These domains can be organized in different combinations to form...

