arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1305.0159q-bio.GNcs.DS
收藏

序列质量评分的自适应无参考压缩

Adaptive reference-free compression of sequence quality scores

Lilian Janin, Giovanna Rosone, Anthony J. Cox

摘要:

动机:DNA测序的快速技术进步激发了人们对压缩现在常规产生的大量数据集的兴趣。相对较少的注意力已经支付给压缩的质量分数分配给每个序列,即使这些分数可能比序列本身更难压缩。通过将一组读段聚集成压缩索引,我们发现大多数碱基可以从与其相邻的碱基序列预测,因此对于变异检测或其他应用可能信息较少。这些碱基的质量分数被积极压缩,在全分辨率下留下相对较小的数量。由于我们的方法直接依赖于读数中存在的冗余,因此它不需要参考序列,因此适用于宏基因组学和从头实验的数据以及重测序数据。结果如下:我们表明,一个保守的平滑策略,影响75%的质量分数高于Q2导致整体质量分数压缩1位每值上的变异检测的影响可以忽略不计。使用更积极的平滑策略实现每个质量值0.68位的压缩,同样对变异检测具有非常小的影响。可用性:在大型基因组数据集上构建BWT和LCP阵列的代码是BEETL库的一部分,可在http://git@github.com上作为github资源库获得:BEETL/BEETL.git。

英文摘要:

Motivation: Rapid technological progress in DNA sequencing has stimulated interest in compressing the vast datasets that are now routinely produced. Relatively little attention has been paid to compressing the quality scores that are assigned to each sequence, even though these scores may be harder to compress than the sequences themselves. By aggregating a set of reads into a compressed index, we find that the majority of bases can be predicted from the sequence of bases that are adjacent to them and hence are likely to be less informative for variant calling or other applications. The quality scores for such bases are aggressively compressed, leaving a relatively small number at full resolution. Since our approach relies directly on redundancy present in the reads, it does not need a reference sequence and is therefore applicable to data from metagenomics and de novo experiments as well as to resequencing data. Results: We show that a conservative smoothing strategy affecting 75% of the quality scores above Q2 leads to an overall quality score compression of 1 bit per value with a negligible effect on variant calling. A compression of 0.68 bit per quality value is achieved using a more aggressive smoothing strategy, again with a very small effect on variant calling. Availability: Code to construct the BWT and LCP-array on large genomic data sets is part of the BEETL library, available as a github respository at http://git@github.com:BEETL/BEETL.git .

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑