BLAST
基本局部比对搜索工具，通过启发式算法在大型序列数据库中快速检索相似序列。 该方法牺牲少量敏感性换取数量级的速度提升，是生物信息学中使用最广泛的工具之一。
| Property | Value |
|---|---|
| Purpose | 快速数据库序列相似性搜索 |
| Time Complexity | O(mn) |
| Space Complexity | O(mn) |
| Year | 1990 |
| Category | Sequence Alignment |
Complexity Analysis
- Time Complexity:
O(mn) - Space Complexity:
O(mn)
Performance Insight: The time complexity of this algorithm is quadratic matrix (O(mn)), SIMD acceleration or approximate methods are advised when m, n exceed 10⁴. High space complexity; consider Hirschberg-style space-optimized variants for very long sequences.
Note: Complexity analysis is based on theoretical models. Actual runtime is affected by input scale, hardware, and implementation optimizations. Benchmark for your specific workload.
Literature & Implementation
Related Tools
BLAST+ · DIAMOND · MMseqs2