Sequence repetitiveness quantification and de novo repeat detection by weighted k-mer coverage. Issue 3 (26th June 2020)

• Record Type: Journal Article
• Authors: Feng, Cong; Dai, Min; Liu, Yongjing; Chen, Ming
• Is Part Of: Briefings in bioinformatics. Volume 22:Issue 3(2021)
• Publication Date: 2020-06-26
• Subjects: DNA repeats -- repetitiveness -- RepLoc -- weighted k-mer coverage; Genetics -- Data processing -- Periodicals; Molecular biology -- Data processing -- Periodicals; Genomes -- Data processing -- Periodicals; 572.80285
• DOI: 10.1093/bib/bbaa086
• Languages: English
• ISSNs: 1467-5463

Abstract

Abstract: DNA repeats are abundant in eukaryotic genomes and have been proved to play a vital role in genome evolution and regulation. A large number of approaches have been proposed to identify various repeats in the genome. Some de novo repeat identification tools can efficiently generate sequence repetitive scores based on k-mer counting for repeat detection. However, we noticed that these tools can still be improved in terms of repetitive score calculation, sensitivity to segmental duplications and detection specificity. Therefore, here, we present a new computational approach named Repeat Locator (RepLoc), which is based on weighted k-mer coverage to quantify the genome sequence repetitiveness and locate the repetitive sequences. According to the repetitiveness map of the human genome generated by RepLoc, we found that there may be relationships between sequence repetitiveness and genome structures. A comprehensive benchmark shows that RepLoc is a more efficient k-mer counting based tool for de novo repeat detection. The RepLoc software is freely available at http://bis.zju.edu.cn/reploc .