MAFFT
基于快速傅里叶变换的多序列比对工具，使用 FFT 加速同源区域检测和比对优化。 该方法提供多种比对策略，能高效处理从数十到数万条序列的比对任务。
| Property | Value |
|---|---|
| Purpose | 高效多序列比对 |
| Time Complexity | O(n * L * log L) |
| Space Complexity | O(n * L) |
| Year | 2002 |
| Category | Sequence Alignment |
Complexity Analysis
- Time Complexity:
O(n * L * log L) - Space Complexity:
O(n * L)
Performance Insight: The time complexity of this algorithm is polynomial.
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
MUSCLE · Clustal Omega · T-Coffee