Related Experiment Video
Updated: Aug 2, 2026

Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues
Published on: July 14, 2015
Detecting protein sequence conservation via metric embeddings
1International Computer Science Institute and Computer Science Division, University of California, Berkeley, CA 94720, USA. eran@eecs.berkeley.edu
This study introduces a novel peptide distance mapping for efficient protein database comparison using BLOSUM matrices. The new method significantly speeds up similarity searches while maintaining high accuracy.
Area of Science:
- Bioinformatics
- Computational Biology
- Genomics
Background:
- Protein database comparison is crucial for biosequence annotation.
- Existing distance-based methods struggle to accurately map proteomic score matrices, like BLOSUM, to metric spaces for efficient similarity searching.
- Prior algorithms, such as Buhler's LSH-ALL-PAIRS-SIM, faced efficiency challenges in proteomic comparisons.
Purpose of the Study:
- To develop a new distance mapping for peptides that enables more efficient similarity searches within protein databases.
- To improve upon existing distance-based algorithms for proteomic comparison by addressing the limitations of previous mapping techniques.
- To enhance the speed of identifying highly scoring protein pairs using BLOSUM matrices.
Main Methods:
- Proposed a novel peptide distance function derived from a given score matrix.
- Developed a method to map peptides to bit vectors, approximating peptide distance with Hamming distance.
- Integrated the new distance mapping with the LSH-ALL-PAIRS-SIM algorithm for improved proteomic comparison.
Main Results:
- The new distance mapping allows for significantly faster similarity searches compared to previous methods.
- The improved algorithm demonstrated sensitivity within 5% of the original LSH-ALL-PAIRS-SIM.
- Initial implementations showed up to an eight-fold increase in speed for proteomic comparison.
Conclusions:
- The proposed distance mapping offers a more efficient approach to protein-protein similarity searching in large databases.
- This method enhances the speed of proteomic comparison while preserving a high degree of accuracy.
- The findings contribute to more effective biosequence annotation and analysis tools.
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...
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...
Evolutionary Relationships through Genome Comparisons
Multi-species Conserved Sequences
Although the genome of each species varies greatly from each other, a few sequences are highly conserved. Such conserved DNA...
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...
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...

