MaxBin 2
利用覆盖度和组成偏好信息的自动分箱方法，通过期望最大化算法从宏基因组组装序列中恢复单个微生物基因组。 该工具在低丰度菌群和复杂环境样本中表现稳健，是宏基因组 binning 与 MAG 构建中的经典方法之一。
| Property | Value |
|---|---|
| Purpose | 基于覆盖度与组成特征进行宏基因组自动分箱 |
| Time Complexity | O(n * c) |
| Space Complexity | O(n) |
| Year | 2016 |
| Category | Metagenomics |
Complexity Analysis
- Time Complexity:
O(n * c) - Space Complexity:
O(n)
Performance Insight: The time complexity of this algorithm is polynomial. Linear space can often be reduced by constant factors via sliding-window techniques.
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
MetaBAT 2 · CONCOCT · CheckM