Kalign
基于 Wu-Manber 字符串匹配算法的快速多序列比对工具，利用序列间的成对距离构建引导树。 该方法在保持较高比对质量的同时具有极快的运行速度，特别适用于大规模序列集合的快速比对。
| Property | Value |
|---|---|
| Purpose | 快速多序列比对 |
| Time Complexity | O(n^2 * L) |
| Space Complexity | O(n * L) |
| Year | 2005 |
| Difficulty | Intermediate |
| Languages | C, C++ |
| Category | Sequence Alignment |
Complexity Analysis
- Time Complexity:
O(n^2 * 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
MAFFT · MUSCLE · Clustal Omega