RegScaf: a regression approach to scaffolding

• Published in: Bioinformatics (Oxford, England) England), 2022-05, Vol.38 (10), p.2675-2682
• Main Authors: Li, Mengtian, Li, Lei M
• Format: Article
• Language: English
• Subjects: Algorithms; Contig Mapping - methods; Genome; High-Throughput Nucleotide Sequencing - methods; Original Papers; Sequence Analysis, DNA - methods; Software
• ISSN: 1367-4803; 1367-4811
• DOI: 10.1093/bioinformatics/btac174

Crucial to the correctness of a genome assembly is the accuracy of the underlying scaffolds that specify the orders and orientations of contigs together with the gap distances between contigs. The current methods construct scaffolds based on the alignments of 'linking' reads against contigs. We found that some 'optimal' alignments are mistaken due to factors such as the contig boundary effect, particularly in the presence of repeats. Occasionally, the incorrect alignments can even overwhelm the correct ones. The detection of the incorrect linking information is challenging in any existing methods. In this study, we present a novel scaffolding method RegScaf. It first examines the distribution of distances between contigs from read alignment by the kernel density. When multiple modes are shown in a density, orientation-supported links are grouped into clusters, each of which defines a linking distance corresponding to a mode. The linear model parameterizes contigs by their positions on the genome; then each linking distance between a pair of contigs is taken as an observation on the difference of their positions. The parameters are estimated by minimizing a global loss function, which is a version of trimmed sum of squares. The least trimmed squares estimate has such a high breakdown value that it can automatically remove the mistaken linking distances. The results on both synthetic and real datasets demonstrate that RegScaf outperforms some popular scaffolders, especially in the accuracy of gap estimates by substantially reducing extremely abnormal errors. Its strength in resolving repeat regions is exemplified by a real case. Its adaptability to large genomes and TGS long reads is validated as well. RegScaf is publicly available at https://github.com/lemontealala/RegScaf.git. Supplementary data are available at Bioinformatics online.