Related Experiment Video
Updated: Aug 13, 2026

A Protocol for Computer-Based Protein Structure and Function Prediction
Published on: November 3, 2011
Fast and simple character classes and bounded gaps pattern matching, with applications to protein searching
Gonzalo Navarro1, Mathieu Raffinot
1Department of Computer Science, University of Chile, Blanco Encalada 2120, Santiago, Chile. gnavarro@dcc.uchile.cl
This study introduces two novel algorithms for efficiently searching patterns with character classes and bounded gaps (CBG) in biological sequences. These methods significantly outperform traditional regular expression searches for protein pattern matching.
Area of Science:
- Bioinformatics
- Computational Biology
- Pattern Recognition
Background:
- Protein pattern matching often involves complex patterns with character classes and bounded gaps (CBG).
- Current methods rely on converting CBGs to regular expressions (REs), which are computationally intensive and slow for pattern matching.
- Existing RE search algorithms are not optimized for the specific structure of CBGs, leading to inefficiencies.
Purpose of the Study:
- To develop novel, efficient algorithms for exact and approximate searching of CBG patterns.
- To provide a simpler and faster alternative to current RE-based pattern matching techniques.
- To enable faster and more accurate protein pattern identification.
Main Methods:
- Designed two new practical algorithms for CBG pattern matching.
- Algorithm 1: Scans each text character exactly once.
- Algorithm 2: Optimizes by potentially skipping text characters, offering speed advantages but with occasional re-scans.
- Developed a criterion to select the optimal algorithm based on CBG structure.
- Incorporated methods for approximate matching with a tolerance for errors.
Main Results:
- Both new algorithms demonstrate significantly faster performance compared to RE search techniques.
- Algorithm 2 is generally faster than Algorithm 1, especially for certain CBG structures.
- Experimental results using the PROSITE database confirm the superior speed of the proposed algorithms in most cases.
- The criterion for algorithm selection effectively identifies the most efficient method a priori.
Conclusions:
- The developed CBG matching algorithms offer a substantial improvement in speed and simplicity over existing RE-based methods.
- These algorithms are highly effective for protein pattern matching and other applications involving CBG patterns.
- The ability to perform approximate matching further enhances the utility of these algorithms in biological sequence analysis.
More Related Videos
07:49Creating and Applying a Reference to Facilitate the Discussion and Classification of Proteins in a Diverse Group
Published on: August 16, 2017
05:08Application of I TASSER, trRosetta, UCSF Chimera, HADDOCK server, and HEX loria for De Novo and In Silico Design of Proteins
Published on: July 8, 2025
Related Concept Videos
Protein Families
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-protein Interfaces
Conserved Binding Sites
Binding sites are often located in large pockets, and if their location on a protein’s surface is unknown, it can be predicted using various approaches. The energetic method computationally analyses the...
Protein Complexes with Interchangeable Parts
The SCF ubiquitin ligase is a protein complex of five individual proteins. This complex attaches ubiquitin to other target proteins to mark them for degradation. In order to...
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...