基因组组装中片段重复的快速表征
Fast Characterization of Segmental Duplications in Genome Assemblies
摘要:
片段重复(SD)或低拷贝重复(LCR)是大于1 Kbp的DNA片段,具有高序列同一性,可复制到基因组的其他区域。SDs是进化的最重要来源之一,是基因组结构变异的常见原因,其中一些与基因组起源的疾病有关。尽管其功能的重要性,SDs提出的从头基因组组装的主要障碍之一,由于它们在建立和穿越最先进的布局-共识和de Bruijn图的模糊性。这导致SD区域被错误组装,折叠成独特的表示,或从各种生物体的组装参考基因组中完全缺失。反过来,这些缺失或不正确的信息限制了我们充分理解基因组进化和结构的能力。尽管有必要准确地表征组装中的SD,但只有一种工具已被开发用于此目的,称为全基因组组装比较(WGAC)。WGAC由几个步骤组成,这些步骤使用不同的工具和自定义脚本,这使得使用起来既困难又耗时。因此,仍然需要算法来快速、准确地并且以用户友好的方式表征组件内SD。在这里,我们引入了一个分段重复评估框架(SEDEF),通过复杂的过滤策略,基于Jaccard相似性和本地链接快速检测SD。我们表明,SEDEF准确地检测SD,同时保持大幅加快WGAC,转化为实际的运行时间分钟,而不是几周。值得注意的是,我们的算法捕获了片段之间高达25%的成对错误,而以前的研究仅关注10%,使我们能够更深入地跟踪基因组的进化历史。SEDEF可在https://github.com/vpc-ccg/sedef上获得
英文摘要:
Segmental duplications (SDs), or low-copy repeats (LCR), are segments of DNA greater than 1 Kbp with high sequence identity that are copied to other regions of the genome. SDs are among the most important sources of evolution, a common cause of genomic structural variation, and several are associated with diseases of genomic origin. Despite their functional importance, SDs present one of the major hurdles for de novo genome assembly due to the ambiguity they cause in building and traversing both state-of-the-art overlap-layout-consensus and de Bruijn graphs. This causes SD regions to be misassembled, collapsed into a unique representation, or completely missing from assembled reference genomes for various organisms. In turn, this missing or incorrect information limits our ability to fully understand the evolution and the architecture of the genomes. Despite the essential need to accurately characterize SDs in assemblies, there is only one tool that has been developed for this purpose, called Whole Genome Assembly Comparison (WGAC). WGAC is comprised of several steps that employ different tools and custom scripts, which makes it difficult and time consuming to use. Thus there is still a need for algorithms to characterize within-assembly SDs quickly, accurately, and in a user friendly manner. Here we introduce a SEgmental Duplication Evaluation Framework (SEDEF) to rapidly detect SDs through sophisticated filtering strategies based on Jaccard similarity and local chaining. We show that SEDEF accurately detects SDs while maintaining substantial speed up over WGAC that translates into practical run times of minutes instead of weeks. Notably, our algorithm captures up to 25% pairwise error between segments, where previous studies focused on only 10%, allowing us to more deeply track the evolutionary history of the genome. SEDEF is available at https://github.com/vpc-ccg/sedef
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。