Smith-Waterman
经典的局部序列比对算法，使用动态规划方法找出两条序列之间相似性最高的局部区域。 该算法保证找到最优的局部比对结果，适用于检测序列中的保守区域和功能域。
| Property | Value |
|---|---|
| Purpose | 局部序列比对，寻找序列间的相似区域 |
| Time Complexity | O(mn) |
| Space Complexity | O(mn) |
| Year | 1981 |
| 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 · FASTA · SSEARCH