BetaSearch: a new method for querying β-residue motifs

Area of Science:

• Structural bioinformatics
• Computational biology
• Protein structure analysis

Background:

• Protein sequence alignment lacks spatial information, hindering the search for structural motifs.
• Existing graph-based and 3D methods for querying β-residue motifs are computationally expensive.
• β-residue motifs, representing β-sheet substructures, require specialized querying approaches.

Purpose of the Study:

• To develop a computationally efficient method for querying β-residue motifs.
• To overcome the limitations of existing graph and 3D substructure search methods.
• To enable high-volume exploratory querying of protein substructural motifs.

Main Methods:

• Developed BetaSearch, a method that indexes β-sheets as 2D matrices, leveraging their planar constraints.
• Utilized graph indexing principles adapted for the specific structural constraints of β-sheets.
• Compared BetaSearch performance against existing graph indexing and 3D substructure search methods.

Main Results:

• BetaSearch offers faster filtering, verification, and overall query times compared to graph indexing methods.
• Achieved significant speedups (33x and 240x) over index-based and pairwise alignment-based 3D substructure search methods, respectively.
• Demonstrated BetaSearch's capability in matching motifs in sequentially dissimilar proteins and predicting β-strand pairing.

Conclusions:

• BetaSearch provides a computationally efficient solution for querying protein substructure motifs.
• Its speed improvements facilitate high-volume exploratory analysis of protein motifs and conformations.
• Successfully identified conserved β-residue motifs in synthetic and natural proteins, and related biotin-binding domains.