Resolving repeat families with long reads

BMC Bioinformatics

Philipp Bongartz¹ 

[1] 0000 0001 2275 2842, grid.424699.4, Heidelberg Institute for Theoretical Studies, Schloss-Wolfsbrunnenweg 35, 69118, Heidelberg, Germany;

关键词: Genome assembly;    Repeat families;    Repeat resolution;   

DOI  :  10.1186/s12859-019-2807-4

来源: publisher

【 摘 要 】

BackgroundDraft quality genomes for a multitude of organisms have become common due to the advancement of genome assemblers using long-read technologies with high error rates. Although current assemblies are substantially more contiguous than assemblies based on short reads, complete chromosomal assemblies are still challenging. Interspersed repeat families with multiple copy versions dominate the contig and scaffold ends of current long-read assemblies for complex genomes. These repeat families generally remain unresolved, as existing algorithmic solutions either do not scale to large copy numbers or can not handle the current high read error rates.ResultsWe propose novel repeat resolution methods for large interspersed repeat families and assess their accuracy on simulated data sets with various distinct repeat structures and on drosophila melanogaster transposons. Additionally, we compare our methods to an existing long read repeat resolution tool and show the improved accuracy of our method.ConclusionsOur results demonstrate the applicability of our methods for the improvement of the contiguity of genome assemblies.

【 授权许可】

CC BY