Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

BLAST (Biotechnology)

String Algorithm

BLAST, the Basic Local Alignment Search Tool, is a bioinformatics algorithm that compares a protein or nucleotide sequence against a database of sequences to find matches above a chosen similarity threshold. It was created by Stephen Altschul, Warren Gish, Webb Miller, Eugene Myers and David Lipman at the National Institutes of Health and published in the Journal of Molecular Biology in 1990. BLAST uses a heuristic approach that trades some accuracy for speed, making it far faster on large-scale searches than exhaustive methods such as Smith-Waterman alignment. Its speed and practicality have made it one of the most cited tools in computational biology, used to search the ever-growing genomic and protein databases. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/

Facts
Classification
Design Technique
Heuristic or Approximation 1
Sources
1. Wikipedia: BLAST (biotechnology)
entity record, description (design-technique)
Quote, entity record, description (design-technique)
BLAST uses a heuristic approach that trades some accuracy for speed, making it far faster on large-scale searches than exhaustive methods such as Smith-Waterman alignment.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.