首页> 外文会议>IEEE International Conference on Bioinformatics and Biomedicine >Correcting genomic deletion calls with complex boundaries from next generation sequencing data
【24h】

Correcting genomic deletion calls with complex boundaries from next generation sequencing data

机译:从下一代测序数据中校正具有复杂边界的基因组删除调用

获取原文

摘要

Along with tumor growth, somatic alternations are continually accumulating, some of which leads to the formations of clonal populations. Genomic deletion is a major type of such genomic alternations. Although tens of computational methods were published, in the past decade, for detecting genomic deletions from next generation sequencing data, the existing algorithms often suffer an accuracy loss when they encounter the cases of deletion calls with complex boundaries. It is reported that a genomic deletion that occurs in different sub-clones may present nearby boundaries. Such deletion is considered as a deletion with complex boundaries. The existing approaches either ignore the complex-boundary cases by reporting the pair of boundaries with the largest numbers of supporting reads, or even provide incorrect results due to the interference data signals. To overcome this weakness, in this paper, we propose a heuristic method, SV-Del, to help the popular methods correct the detection errors, which are introduced by complex boundaries. The results of an existing method are the given candidate calls. SV-Del filters these calls and identifies the ones with complex boundaries. The proposed method first adopts a segmented extension algorithm and utilizes the longest variable splitting-read strategy to detect the possible pairs of boundaries in each candidate region. Then, it uses the longest variable splitting-reads to correct the detection errors which may introduced by clonal SNVs. To differentiate the detection errors from possible pairs of deletion boundaries, SV-Del estimates the numbers of sub-clones across sampled candidate regions, and then it uses a gradually separating algorithm to attain and refine the candidate calls. We applied SV-Del on a series of simulated datasets which are generated by different settings. The experiment results demonstrate that the detection accuracy is significantly improved comparing to the original results. SV-Del is also shown robust. The source codes and software package of SV-Del are uploaded at https://github.com/Hope523/SV-Del for academic uses only.
机译:随着肿瘤的生长,体细胞的交替不断累积,其中一些导致克隆种群的形成。基因组缺失是这种基因组交替的主要类型。尽管已发布了数十种计算方法,但在过去的十年中,用于检测下一代测序数据中的基因组缺失,但是当现有算法遇到具有复杂边界的缺失调用时,它们经常会遭受精度损失。据报道,发生在不同亚克隆中的基因组缺失可能会出现附近的边界。这种删除被认为是具有复杂边界的删除。现有方法要么通过报告支持读取次数最多的一对边界来忽略复杂边界情况,要么由于干扰数据信号而提供不正确的结果。为了克服这一弱点,在本文中,我们提出了一种启发式方法SV-Del,以帮助流行的方法纠正由复杂边界引入的检测错误。现有方法的结果是给定的候选调用。 SV-Del过滤这些呼叫并识别具有复杂边界的呼叫。提出的方法首先采用分段扩展算法,并利用最长的变量拆分读取策略来检测每个候选区域中可能的边界对。然后,它使用最长的变量拆分读取来纠正克隆SNV可能引入的检测错误。为了将检测错误与可能的缺失边界对区分开来,SV-Del估计采样的候选区域中子克隆的数目,然后使用逐渐分离的算法来获得和优化候选呼叫。我们将SV-Del应用于一系列由不同设置生成的模拟数据集。实验结果表明,检测结果与原始结果相比有明显提高。 SV-Del也显示为坚固。 SV-Del的源代码和软件包已上传到https://github.com/Hope523/SV-Del,仅供学术使用。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号