Linear-size suffix tries and linear-size CDAWGs simplified and improved

IF 0.4 4区 计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Acta Informatica Pub Date : 2024-08-23 DOI:10.1007/s00236-024-00465-9
Shunsuke Inenaga
{"title":"Linear-size suffix tries and linear-size CDAWGs simplified and improved","authors":"Shunsuke Inenaga","doi":"10.1007/s00236-024-00465-9","DOIUrl":null,"url":null,"abstract":"<div><p>The <i>linear-size suffix tries</i> (<i>LSTries</i>) (Crochemore et al. in Theor Comput Sci 638:171–178, 2016) are a version of suffix trees in which the edge labels are single characters, yet are able to perform pattern matching queries in optimal time. Instead of explicitly storing the input text, LSTries have some extra non-branching internal nodes called <i>type-2</i> nodes. The extended techniques are then used in the <i>linear-size compact directed acyclic word graphs</i> (<i>LCDAWGs</i>) (Takagi et al., in: SPIRE 2017, pp. 304–316, 2017), which can be stored with <span>\\(O(\\textsf{el}(T)+\\textsf{er}(T))\\)</span> space (i.e. without the text), where <span>\\(\\textsf{el}(T)\\)</span> and <span>\\(\\textsf{er}(T)\\)</span> are the numbers of left- and right-extensions of the maximal repeats in the input text string <i>T</i>, respectively. In this paper, we present simpler alternatives to the aforementioned indexing structures, called the <i>simplified LSTries</i> (<i>simLSTries</i>) and the <i>simplified LCDAWGs</i> (<i>simLCDAWGs</i>), in which most of the type-2 nodes are removed. In particular, our simLCDAWGs require only <span>\\(O(\\textsf{er}(T))\\)</span> space and work in a weaker model of computation (i.e. the pointer machine model). This contrasts the <span>\\(O(\\textsf{er}(T))\\)</span>-space CDAWG representation of Belazzougui and Cunial (in: Proceedings of the 24th international symposium on string processing and information retrieval, pp. 161–175, 2017), which works on the word RAM model.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":null,"pages":null},"PeriodicalIF":0.4000,"publicationDate":"2024-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Informatica","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s00236-024-00465-9","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

The linear-size suffix tries (LSTries) (Crochemore et al. in Theor Comput Sci 638:171–178, 2016) are a version of suffix trees in which the edge labels are single characters, yet are able to perform pattern matching queries in optimal time. Instead of explicitly storing the input text, LSTries have some extra non-branching internal nodes called type-2 nodes. The extended techniques are then used in the linear-size compact directed acyclic word graphs (LCDAWGs) (Takagi et al., in: SPIRE 2017, pp. 304–316, 2017), which can be stored with \(O(\textsf{el}(T)+\textsf{er}(T))\) space (i.e. without the text), where \(\textsf{el}(T)\) and \(\textsf{er}(T)\) are the numbers of left- and right-extensions of the maximal repeats in the input text string T, respectively. In this paper, we present simpler alternatives to the aforementioned indexing structures, called the simplified LSTries (simLSTries) and the simplified LCDAWGs (simLCDAWGs), in which most of the type-2 nodes are removed. In particular, our simLCDAWGs require only \(O(\textsf{er}(T))\) space and work in a weaker model of computation (i.e. the pointer machine model). This contrasts the \(O(\textsf{er}(T))\)-space CDAWG representation of Belazzougui and Cunial (in: Proceedings of the 24th international symposium on string processing and information retrieval, pp. 161–175, 2017), which works on the word RAM model.

Abstract Image

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
简化和改进线性大小后缀尝试和线性大小 CDAWG
线性大小后缀树(linear-size suffix tries,LSTries)(Crochemore 等人,载于 Theor Comput Sci 638:171-178, 2016)是后缀树的一个版本,其中的边标签是单字符,但却能在最佳时间内执行模式匹配查询。LSTries 不明确存储输入文本,而是有一些额外的非分支内部节点,称为 Type-2 节点。扩展技术随后被用于线性大小的紧凑有向无环词图(LCDAWGs)(Takagi et al、in: SPIRE 2017, pp. 304-316, 2017),它可以用 \(O(\textsf{el}(T)+\textsf{er}(T))\)空间存储(即不含文本),其中 \(\textsf{el}(T)\)和 \(\textsf{er}(T)\)分别是输入文本串 T 中最大重复次数的左扩展和右扩展的数量。在本文中,我们提出了上述索引结构的简化替代方案,称为简化 LSTries(simLSTries)和简化 LCDAWGs(simLCDAWGs),其中去除了大部分类型 2 节点。特别是,我们的 simLCDAWGs 只需要 \(O(\textsf{er}(T))\) 空间,并且可以在较弱的计算模型(即指针机模型)中工作。这与 Belazzougui 和 Cunial 的 \(O(\textsf{er}(T)) \)空间 CDAWG 表示(in:第 24 届字符串处理与信息检索国际研讨会论文集》(Proceedings of the 24th international symposium on string processing and information retrieval, pp.
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Acta Informatica
Acta Informatica 工程技术-计算机:信息系统
CiteScore
2.40
自引率
16.70%
发文量
24
审稿时长
>12 weeks
期刊介绍: Acta Informatica provides international dissemination of articles on formal methods for the design and analysis of programs, computing systems and information structures, as well as related fields of Theoretical Computer Science such as Automata Theory, Logic in Computer Science, and Algorithmics. Topics of interest include: • semantics of programming languages • models and modeling languages for concurrent, distributed, reactive and mobile systems • models and modeling languages for timed, hybrid and probabilistic systems • specification, program analysis and verification • model checking and theorem proving • modal, temporal, first- and higher-order logics, and their variants • constraint logic, SAT/SMT-solving techniques • theoretical aspects of databases, semi-structured data and finite model theory • theoretical aspects of artificial intelligence, knowledge representation, description logic • automata theory, formal languages, term and graph rewriting • game-based models, synthesis • type theory, typed calculi • algebraic, coalgebraic and categorical methods • formal aspects of performance, dependability and reliability analysis • foundations of information and network security • parallel, distributed and randomized algorithms • design and analysis of algorithms • foundations of network and communication protocols.
期刊最新文献
Editorial 2024: moving forwards in the electronic age Serial and parallel algorithms for order-preserving pattern matching based on the duel-and-sweep paradigm Linear-size suffix tries and linear-size CDAWGs simplified and improved Parameterized aspects of distinct Kemeny rank aggregation Word-representable graphs from a word’s perspective
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1