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

Prefix-free parsing for merging big BWTs. 用于合并大型bwt的无前缀解析。

International Symposium on String Processing and Information Retrieval : SPIRE ... : proceedings. SPIRE (Symposium) Pub Date : 2026-01-01 Epub Date: 2025-09-22 DOI: 10.1007/978-3-032-05228-5_6

Diego Díaz-Domínguez, Travis Gagie, Veronica Guerrini, Ben Langmead, Zsuzsanna Lipták, Giovanni Manzini, Francesco Masillo, Vikram Shivakumar

引用次数: 0

KeBaB: k-mer based breaking for finding long MEMs. KeBaB：基于k-mer的断裂，用于寻找长MEMs。

International Symposium on String Processing and Information Retrieval : SPIRE ... : proceedings. SPIRE (Symposium) Pub Date : 2026-01-01 Epub Date: 2025-09-22 DOI: 10.1007/978-3-032-05228-5_2

Nathaniel K Brown, Lore Depuydt, Mohsen Zakeri, Anas Alhadi, Nour Allam, Dove Begleiter, Nithin Bharathi Kabilan Karpagavalli, Suchith Sridhar Khajjayam, Hamza Wahed, Travis Gagie, Ben Langmead

引用次数: 0

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":"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].","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

A simple grammar-based index for finding approximately longest common substrings. 一个简单的基于语法的索引，用于查找大约最长的公共子字符串。

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

Travis Gagie, Sana Kashgouli, Gonzalo Navarro

{"title":"A simple grammar-based index for finding approximately longest common substrings.","authors":"Travis Gagie, Sana Kashgouli, Gonzalo Navarro","doi":"10.1007/978-3-031-43980-3_19","DOIUrl":"10.1007/978-3-031-43980-3_19","url":null,"abstract":"We show how, given positive constants <math><mi>ϵ</mi></math> and <math><mi>δ</mi></math> , and an <math><mi>α</mi></math> -balanced straight-line program with <math><mi>g</mi></math> rules for a text <math><mi>T</mi> <mo>[</mo> <mn>1</mn> <mo>.</mo> <mo>.</mo> <mi>n</mi> <mo>]</mo></math> , we can build an <math><mi>O</mi> <mo>(</mo> <mi>g</mi> <mo>)</mo></math> -space index that, given a pattern <math><mi>P</mi> <mo>[</mo> <mn>1</mn> <mo>.</mo> <mo>.</mo> <mi>m</mi> <mo>]</mo></math> , in <math><mi>O</mi> <mfenced><mrow><mi>m</mi> <mspace></mspace> <msup><mrow><mtext>log</mtext></mrow> <mrow><mi>δ</mi></mrow> </msup> <mspace></mspace> <mi>g</mi></mrow> </mfenced> </math> time finds w.h.p. a substring of <math><mi>P</mi></math> that occurs in <math><mi>T</mi></math> and whose length is at least a ( <math><mn>1</mn> <mo>-</mo> <mi>ϵ</mi></math> ) fraction of the longest common substring of <math><mi>P</mi></math> and <math><mi>T</mi></math> . The correctness can be ensured within the same expected query time.","PeriodicalId":520001,"journal":{"name":"International Symposium on String Processing and Information Retrieval : SPIRE ... : proceedings. SPIRE (Symposium)","volume":"14240 ","pages":"246-252"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12700360/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145759341","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