Suppr超能文献

MONI的增强阈值。

Augmented Thresholds for MONI.

作者信息

Martínez-Guardiola César, Brown Nathaniel K, Silva-Coira Fernando, Köppl Dominik, Gagie Travis, Ladra Susana

机构信息

Universidade da Coruña, CITIC, A Coruña, Spain.

Dalhousie U, Halifax, Canada.

出版信息

Proc Data Compress Conf. 2023 Mar;2023:268-277. doi: 10.1109/dcc55655.2023.00035. Epub 2023 May 19.

Abstract

MONI (Rossi et al., 2022) can store a pangenomic dataset in small space and later, given a pattern , quickly find the maximal exact matches (MEMs) of with respect to . In this paper we consider its one-pass version (Boucher et al., 2021), whose query times are dominated in our experiments by longest common extension (LCE) queries. We show how a small modification lets us avoid most of these queries which significantly speeds up MONI in practice while only slightly increasing its size.

摘要

MONI(罗西等人,2022年)可以在小空间中存储一个泛基因组数据集,之后,给定一个模式,能快速找到该模式相对于数据集的最大精确匹配(MEMs)。在本文中,我们考虑其单遍版本(布歇等人,2021年),在我们的实验中,其查询时间主要由最长公共扩展(LCE)查询决定。我们展示了一个小修改如何使我们避免大多数此类查询,这在实际中显著加快了MONI的速度,同时仅略微增加其规模。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2bc9/11138128/f8809979ed0e/nihms-1994074-f0002.jpg

相似文献

1
Augmented Thresholds for MONI.MONI的增强阈值。
Proc Data Compress Conf. 2023 Mar;2023:268-277. doi: 10.1109/dcc55655.2023.00035. Epub 2023 May 19.
2
Faster Maximal Exact Matches with Lazy LCP Evaluation.通过延迟最长公共前缀(LCP)评估实现更快的最大精确匹配
Proc Data Compress Conf. 2024 Mar;2024:123-132. doi: 10.1109/dcc58796.2024.00020. Epub 2024 May 21.
3
MONI: A Pangenomic Index for Finding Maximal Exact Matches.MONI:用于寻找最大精确匹配的泛基因组索引。
J Comput Biol. 2022 Feb;29(2):169-187. doi: 10.1089/cmb.2021.0290. Epub 2022 Jan 17.
5
PFP Compressed Suffix Trees.PFP压缩后缀树
Proc Worksh Algorithm Eng Exp. 2021;2021:60-72. doi: 10.1137/1.9781611976472.5.
6
How to Find Long Maximal Exact Matches and Ignore Short Ones.如何找到长的最大精确匹配并忽略短的匹配。
Dev Lang Theory. 2024 Aug;14791:131-140. doi: 10.1007/978-3-031-66159-4_10. Epub 2024 Jul 27.
7
Finding maximal exact matches in graphs.在图中寻找最大精确匹配。
Algorithms Mol Biol. 2024 Mar 11;19(1):10. doi: 10.1186/s13015-024-00255-5.

引用本文的文献

1
Faster Maximal Exact Matches with Lazy LCP Evaluation.通过延迟最长公共前缀(LCP)评估实现更快的最大精确匹配
Proc Data Compress Conf. 2024 Mar;2024:123-132. doi: 10.1109/dcc58796.2024.00020. Epub 2024 May 21.

本文引用的文献

1
MONI: A Pangenomic Index for Finding Maximal Exact Matches.MONI:用于寻找最大精确匹配的泛基因组索引。
J Comput Biol. 2022 Feb;29(2):169-187. doi: 10.1089/cmb.2021.0290. Epub 2022 Jan 17.
3
PHONI: Streamed Matching Statistics with Multi-Genome References.PHONI:多基因组参考的流式匹配统计
Proc Data Compress Conf. 2021 Mar;2021:193-202. doi: 10.1109/dcc50243.2021.00027. Epub 2021 May 10.
4
Pan-genomic matching statistics for targeted nanopore sequencing.靶向纳米孔测序的泛基因组匹配统计
iScience. 2021 Jun 8;24(6):102696. doi: 10.1016/j.isci.2021.102696. eCollection 2021 Jun 25.
7
Prefix-free parsing for building big BWTs.用于构建大型Burrows-Wheeler变换(BWT)的无前缀解析
Algorithms Mol Biol. 2019 May 24;14:13. doi: 10.1186/s13015-019-0148-5. eCollection 2019.
10
Fast gapped-read alignment with Bowtie 2.快速缺口读对准与 Bowtie 2。
Nat Methods. 2012 Mar 4;9(4):357-9. doi: 10.1038/nmeth.1923.

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验