Skip to content

Flye

基于重复图的长读段从头组装工具,使用 A-Bruijn 图处理长读段中的重复序列。 该方法对 ONT 和 PacBio CLR 读段效果出色,能快速组装完整的微生物和中大型基因组。

PropertyValue
Purpose长读段快速从头组装
Time ComplexityO(n log n)
Space ComplexityO(n)
Year2019
CategorySequence Assembly

Complexity Analysis

  • Time Complexity: O(n log n)
  • Space Complexity: O(n)

Performance Insight: The time complexity of this algorithm is quasi-linear (n log n), balancing practical efficiency with theoretical near-optimality. 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

Canu · Hifiasm · Miniasm

Tags

repeat-graph long-read ont fast

Released under the MIT License.