International Symposium on String Processing and Information Retrieval : SPIRE ... : proceedings. SPIRE (Symposium)最新文献

筛选

英文中文

Data Structures for SMEM-Finding in the PBWT. 用于在 PBWT 中寻找 SMEM 的数据结构。

International Symposium on String Processing and Information Retrieval : SPIRE ... : proceedings. SPIRE (Symposium) Pub Date : 2023-09-01 Epub Date: 2023-09-20 DOI: 10.1007/978-3-031-43980-3_8

Paola Bonizzoni, Christina Boucher, Davide Cozzi, Travis Gagie, Dominik Köppl, Massimiliano Rossi

引用次数: 0

Space-time Trade-offs for the LCP Array of Wheeler DFAs. 惠勒 DFA LCP 阵列的时空权衡。

International Symposium on String Processing and Information Retrieval : SPIRE ... : proceedings. SPIRE (Symposium) Pub Date : 2023-09-01 Epub Date: 2023-09-20 DOI: 10.1007/978-3-031-43980-3_12

Nicola Cotumaccio, Travis Gagie, Dominik Köppl, Nicola Prezza

{"title":"Space-time Trade-offs for the LCP Array of Wheeler DFAs.","authors":"Nicola Cotumaccio, Travis Gagie, Dominik Köppl, Nicola Prezza","doi":"10.1007/978-3-031-43980-3_12","DOIUrl":"10.1007/978-3-031-43980-3_12","url":null,"abstract":"<p><p>Recently, Conte et al. generalized the longest-common prefix (LCP) array from strings to Wheeler DFAs, and they showed that it can be used to efficiently determine matching statistics on a Wheeler DFA [DCC 2023]. However, storing the LCP array requires <math><mrow><mi>O</mi> <mfenced><mrow><mi>n</mi> <mi>log</mi> <mi>n</mi></mrow> </mfenced> </mrow> </math> bits, <math><mi>n</mi></math> being the number of states, while the compact representation of Wheeler DFAs often requires much less space. In particular, the BOSS representation of a de Bruijn graph only requires a linear number of bits, if the size of alphabet is constant. In this paper, we propose a sampling technique that allows to access an entry of the LCP array in logarithmic time by only storing a linear number of bits. We use our technique to provide a space-time tradeoff to compute matching statistics on a Wheeler DFA. In addition, we show that by augmenting the BOSS representation of a <math><mi>k</mi></math> -th order de Bruijn graph with a linear number of bits we can navigate the underlying variable-order de Bruijn graph in time logarithmic in <math><mi>k</mi></math> , thus improving a previous bound by Boucher et al. which was linear in <math><mi>k</mi></math> [DCC 2015].</p>","PeriodicalId":520001,"journal":{"name":"International Symposium on String Processing and Information Retrieval : SPIRE ... : proceedings. SPIRE (Symposium)","volume":"14240 ","pages":"143-156"},"PeriodicalIF":0.0,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11301794/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141899308","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

KATKA: A KRAKEN-like tool with k given at query time. KATKA：类似 KRAKEN 的工具，k 值在查询时给出。

International Symposium on String Processing and Information Retrieval : SPIRE ... : proceedings. SPIRE (Symposium) Pub Date : 2022-11-01 DOI: 10.1007/978-3-031-20643-6_14

Travis Gagie, Sana Kashgouli, Ben Langmead

引用次数: 0