Britannica
Sources used in this answer
How do sequence-search algorithms find similar genes or proteins in databases?
Created from Britannica articles
using AI.
AI can make mistakes, so verify using Britannica articles.
bioinformatics
This computerized image of anthrax shows the various structural relationships of seven units within the protein and demonstrates the interaction of a drug (shown in yellow) bound to the protein to block the so-called lethal factor unit. Bioinformatics plays an important role in enabling scientists to predict where a drug molecule will bind within a protein, given the individual structures of the molecules.
In the field of bioinformatics, sequence-search algorithms identify similar genes or proteins by comparing a query sequence against vast databases of biological data. Because the volume of data is immense, these algorithms must balance speed with sensitivity.1
Key Algorithmic Approaches
- Dynamic Programming: The Needleman-Wunsch algorithm is a classic method that guarantees the optimal alignment of two sequences. It functions by breaking a large sequence into smaller segments, solving them, and using those results to construct a final alignment. While highly accurate, this approach is computationally intensive and often too slow for searching large databases.1
- Heuristic Search Tools: To manage large-scale data, researchers use faster, heuristic-based programs like BLAST (Basic Local Alignment Search Tool). These tools prioritize speed while maintaining sufficient sensitivity to detect relevant matches.1
- Pattern-Based Refinement: Advanced iterations, such as PSI-BLAST, enhance search capabilities by incorporating patterns of conservation found in related sequences, allowing for the detection of more distant evolutionary relationships.1
These algorithms rely on scoring matrices to quantify similarities and account for gaps in alignments, enabling scientists to identify functional domains and evolutionary links between different organisms.12