.png){kind=icon}
返回
GapReduce: A Gap Filling Algorithm Based on Partitioned Read Sets
.png){kind=icon}
PRE
AI
DOI：10.1109/TCBB.2018.2789909.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
With the advances in technologies of sequencing and assembly, draft sequences of more and more genomes are available. However, there commonly exist gaps in these draft sequences which influence various downstream analysis of biological studies. Gap filling methods can shorten the length of gaps and improve the completion of these draft sequences of genomes. Although some gap filling tools have been developed, their effectiveness and accuracy need to be improved. In this study, we develop a novel tool, called GapReduce, which can fill the gaps using the paired reads. For a gap, GapReduce selects the reads whose mate reads are aligned on the left or the right flanking region, and partitions the reads to two sets. Then GapReduce adopts different k values and k-mermer frequency thresholds to iteratively construct De Bruijn graphs, which are used for finding the correct path to fill the gap. For overcoming the branching problems caused by repetitive regions and sequencing errors in the procedure of path selection, GapReduce designs a novel approach that simultaneously considers k-mermer frequency and distribution of paired reads based on the partitioned read sets. We compare the performance of GapReduce with current popular gap filling tools. The experimental results demonstrate that GapReduce can produce satisfactory gap filling results, especially for long insert size datasets. GapReduce is publicly available for downloading at https://github.com/bioinfomaticsCSU/GapReduce.
Keyword:
Gap filling
sequence assembly
sequencing technology
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.4
论文数:
3.3K
被引数:
6.4K
机构
引用论文
Improving draft assemblies by iterative mapping and assembly of short reads to eliminate gaps.png)
GENOME BIOLOGY
OAAI
GENOME BIOLOGYIF9.4
OAAI分享收藏Velvet: Algorithms for de novo short read assembly using de Bruijn graphsVelvet: 使用de Bruijn图进行从头短读组装的算法GENOME RESEARCHOAAI
GENOME RESEARCHIF5.5
OAAI分享收藏
ISEA: Iterative Seed-Extension Algorithm for De Novo Assembly Using Paired-End Information and Insert Size DistributionIsa: 使用配对端信息和插入大小分布进行从头组装的迭代种子扩展算法
PREAI
分享收藏分享收藏SOAPdenovo2: an empirically improved memory-efficient short-read de novo assemblerGIGASCIENCEOAAI
GIGASCIENCEIF3.9
OAAI分享收藏
查看更多内容