FastTree
面向大规模多序列比对的近似最大似然建树工具，通过启发式搜索快速生成大规模系统发育树。 该方法在处理上万条序列时速度明显快于传统方法，是高通量进化分析和微生物组研究中的常用选择。
| Property | Value |
|---|---|
| Purpose | 大规模序列集合的快速近似最大似然建树 |
| Time Complexity | O(n * s * log n) |
| Space Complexity | O(n * s) |
| Year | 2010 |
| Category | Phylogenetics |
Complexity Analysis
- Time Complexity:
O(n * s * log n) - Space Complexity:
O(n * s)
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
IQ-TREE · RAxML-NG · PhyML