Sign in
BioinformaticsbioRxiv
Preprint

RefKA: A fast and efficient long-read genome assembly approach for large and complex genomes

Yuxuan YuaniD, Philipp E. BayeriD, Robyn AndersoniD, HueyTyng LeeiD, Chon‐Kit Kenneth ChaniD, Ruolan Zhao, Jacqueline BatleyiD, David EdwardsiD

Abstract

Recent advances in long-read sequencing have the potential to produce more complete genome assemblies using sequence reads which can span repetitive regions. However, overlap based assembly methods routinely used for this data require significant computing time and resources. Here, we have developed RefKA, a reference-based approach for long read genome assembly. This approach relies on breaking up a closely related reference genome into bins, aligning k-mers unique to each bin with PacBio reads, and then assembling each bin in parallel followed by a final bin-stitching step. During benchmarking, we assembled the wheat Chinese Spring (CS) genome using publicly available PacBio reads in parallel in 168 wall hours on a 250 CPU system. The maximum RAM used was 300 Gb and the computing time was 42,000 CPU hours. The approach opens applications for the assembly of other large and complex genomes with much-reduced computing requirements. The RefKA pipeline is available at https://github.com/AppliedBioinformatics/RefKA

PDFDOICode

02 /Specification & Classification

Click any tag to browse matching papers

Reproducibility ledger

Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.

Sign in to file a reproducibility report.

Similarity Map
SelectedSame fieldCross-field
THISShi '25Ghosh '19Nip '23Wong '23Vaser '19Chin '19
70% semantic matchBioinformatics
X J Shi, Hansen Chen, Fan Nie+1 more·bioRxiv·Dec 25, 2025