Burrows-Wheeler Transform Alignment
基于 Burrows-Wheeler 变换的序列比对算法，通过构建 BWT 索引实现快速的短读段比对。 该方法在保持高准确性的同时大幅提升比对速度，是现代测序数据分析的核心算法。
| Property | Value |
|---|---|
| Purpose | 高通量测序数据的快速比对 |
| Time Complexity | O(n) |
| Space Complexity | O(n) |
| Year | 2009 |
| Category | Sequence Alignment |
Complexity Analysis
- Time Complexity:
O(n) - Space Complexity:
O(n)
Performance Insight: The time complexity of this algorithm is linear (O(n)), scales linearly to TB-scale data and is suitable for streaming pipelines. 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
BWA · Bowtie · HISAT2