PhyML
基于最大似然法的快速系统发育树构建工具，使用启发式搜索策略加速树拓扑的优化。该方法可自动选择最优的核苷酸或蛋白质替换模型。
| Property | Value |
|---|---|
| Purpose | 快速最大似然系统发育推断 |
| Time Complexity | O(n^2 * s) |
| Space Complexity | O(n * s) |
| Year | 2003 |
| Difficulty | Intermediate |
| Languages | C |
| Category | Phylogenetics |
Complexity Analysis
- Time Complexity:
O(n^2 * s) - 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
RAxML-NG · IQ-TREE · FastTree