论文标题
Moni的增强阈值
Augmented Thresholds for MONI
论文作者
论文摘要
Moni（Rossi等，2022）可以将Pangenomic数据集T存储在较小的空间中，后来，给定图案P，迅速找到了P相对于T的最大精确匹配（MEM）。在本文中，我们考虑了其一个通用版本（Boucher等，2021）（Boucher等，2021），其Query Query Time在我们的实验中占主导地位（Lece of Lordiontions tiles tim timest of Flastiontions ty Longess common Exterients ie timest common extimentions ques ques ques）（lce）。我们展示了一个小的修改如何使我们避免大多数此类查询，从而在实践中显着加快了Moni的速度，而仅略微增加了其大小。
MONI (Rossi et al., 2022) can store a pangenomic dataset T in small space and later, given a pattern P, quickly find the maximal exact matches (MEMs) of P with respect to T. 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 and thus significantly speeds up MONI in practice while only slightly increasing its size.
