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
Time Complexity
Time Complexity (category) Classification
Design TechniqueHeuristic or Approximation 1 Connections
Uses Design Technique
Entity-backed identity for the design-technique enum value this algorithm already carries, resolved to a computing concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The design-technique fact itself stays on the algorithm unchanged.
Entity-backed identity for the design-technique enum value this algorithm already carries, resolved to a computing concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The design-technique fact itself stays on the algorithm unchanged.
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 Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.