Connecting Syncmers to FracMinHash: similarities and advantages

Author:

Liu ShaopengORCID,Koslicki DavidORCID

Abstract

AbstractMotivationSketching methods provide scalable solutions for analyzing rapidly growing genomic data. A recent innovation in sketching methods, syncmers, has proven effective and has been employed for read alignment. Syncmers share fundamental features with the FracMinHash technique, a recent modification of the popular MinHash algorithm for set similarity estimation between sets of different sizes. While previous researchers have demonstrated the effectiveness of syncmers in read alignment, their potential for use in genomic analysis (for which FracMinHash was designed) has not been fully realized.ResultsWe demonstrate that the open syncmer sketch is equivalent to a FracMinHash sketch when applying tok-mer-based similarities, yet it exhibits superior distance distribution and genomic coverage. Moreover, we can expand the concept ofk-mer truncation to open syncmers, enabling multi-resolution estimation in metagenomics as well as flexible-sized seeding for sequence comparisons.ReproducibilityAll analysis scripts can be found onGitHub.

Publisher

Cold Spring Harbor Laboratory

Reference21 articles.

1. A. Z. Broder . On the resemblance and containment of documents. In Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No. 97TB100171), pages 21–29. IEEE, 1997.

2. Parameterized syncmer schemes improve long-read mapping;PLOS Computational Biology,2022

3. Syncmers are more sensitive than minimizers for selecting conserved k‑mers in biological sequences

4. Minimizer-space de bruijn graphs: Whole-genome assembly of long reads in minutes on a personal computer;Cell systems,2021

5. Performance of the most common non-cryptographic hash functions

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3