RefLA: Efficient reference-guided genome assembly from long reads

preprint OA: closed
Full text JSON View at publisher

Abstract

High-quality de novo genome assembly from long reads remains computationally demanding, while fast assemblers often compromise on contiguity or accuracy. This trade-off between speed and assembly quality presents a persistent challenge in large-scale genomic studies. Fortunately, high-quality reference genomes are now available for a growing number of species. These references can be leveraged to assist the assembly of closely related genomes, enabling efficient reconstruction without sacrificing fidelity—particularly when evolutionary divergence is moderate.We present RefLA, a reference-assisted assembler tailored for thirdgeneration long-read data. By combining alignment-guided structural refinement with localized reassembly, RefLA achieves accuracy comparable to or better than state-of-the-art de novo tools such as Flye and hifiasm, while running significantly faster. It also surpasses rapid assemblers like wtdbg2 and Shasta in both contiguity and base-level correctness.
Full text 1,075 characters · extracted from oa-doi-fallback · click to expand
Abstract High-quality de novo genome assembly from long reads remains computationally demanding, while fast assemblers often compromise on contiguity or accuracy. This trade-off between speed and assembly quality presents a persistent challenge in large-scale genomic studies. Fortunately, high-quality reference genomes are now available for a growing number of species. These references can be leveraged to assist the assembly of closely related genomes, enabling efficient reconstruction without sacrificing fidelity—particularly when evolutionary divergence is moderate.We present RefLA, a reference-assisted assembler tailored for thirdgeneration long-read data. By combining alignment-guided structural refinement with localized reassembly, RefLA achieves accuracy comparable to or better than state-of-the-art de novo tools such as Flye and hifiasm, while running significantly faster. It also surpasses rapid assemblers like wtdbg2 and Shasta in both contiguity and base-level correctness. Competing Interest Statement The authors have declared no competing interest.

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: oa-doi-fallback

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2025) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00