Related Experiment Videos
Rapid and sensitive protein similarity searches
Science (New York, N.Y.)
|March 22, 1985
Summary
A new algorithm enables rapid protein sequence similarity searches on microcomputers. This advancement makes sensitive database comparisons a routine procedure for molecular biologists, accelerating research.
Area of Science:
- Bioinformatics
- Computational Biology
- Molecular Biology
Background:
- Protein sequence analysis is crucial for understanding protein function and evolution.
- Existing methods for searching large protein databases can be computationally intensive and time-consuming.
Purpose of the Study:
- To develop an efficient algorithm for identifying similarities between newly determined amino acid sequences and existing database sequences.
- To enable sensitive protein database searches as a routine procedure for molecular biologists.
Main Methods:
- Developed an algorithm that identifies regions of similar sequence.
- Utilizes an amino acid replacement matrix to score aligned residues, increasing sensitivity by considering evolutionary frequency.
- Implemented the algorithm in a rapid protein database searching computer program.
Main Results:
- The algorithm efficiently identifies similar sequence regions and scores alignments.
- A comparison of a 200-amino-acid sequence against a 500,000-residue database takes under 10 minutes on a microcomputer.
- Demonstrated the feasibility of sensitive protein database searches on microcomputers.
Conclusions:
- The developed algorithm significantly enhances the speed and accessibility of protein sequence similarity searches.
- This tool can become a routine procedure for molecular biologists, facilitating faster discovery.
- The method's efficiency on microcomputers democratizes advanced bioinformatics analysis.