Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Pia̧tkowski
{"title":"Constructing and indexing the bijective and extended Burrows–Wheeler transform","authors":"Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Pia̧tkowski","doi":"10.1016/j.ic.2024.105153","DOIUrl":null,"url":null,"abstract":"<div><p>The Burrows–Wheeler transform (BWT) is a permutation whose applications are prevalent in data compression and text indexing. The <em>bijective BWT</em> is a bijective variant of it that has not yet been studied for text indexing applications. We fill this gap by proposing a self-index built on the bijective BWT. The self-index applies the backward search technique of the FM-index to find a pattern <em>P</em> with <span><math><mi>O</mi><mo>(</mo><mo>|</mo><mi>P</mi><mo>|</mo><mi>lg</mi><mo></mo><mo>|</mo><mi>P</mi><mo>|</mo><mo>)</mo></math></span> backward search steps. Additionally, we propose the first linear-time construction algorithm that is based on SAIS, improving the best known result of <span><math><mi>O</mi><mo>(</mo><mi>n</mi><mi>lg</mi><mo></mo><mi>n</mi><mo>/</mo><mi>lg</mi><mo></mo><mi>lg</mi><mo></mo><mi>n</mi><mo>)</mo></math></span> time to linear.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"297 ","pages":"Article 105153"},"PeriodicalIF":0.8000,"publicationDate":"2024-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information and Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S089054012400018X","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
The Burrows–Wheeler transform (BWT) is a permutation whose applications are prevalent in data compression and text indexing. The bijective BWT is a bijective variant of it that has not yet been studied for text indexing applications. We fill this gap by proposing a self-index built on the bijective BWT. The self-index applies the backward search technique of the FM-index to find a pattern P with backward search steps. Additionally, we propose the first linear-time construction algorithm that is based on SAIS, improving the best known result of time to linear.
期刊介绍：
Information and Computation welcomes original papers in all areas of theoretical computer science and computational applications of information theory. Survey articles of exceptional quality will also be considered. Particularly welcome are papers contributing new results in active theoretical areas such as
-Biological computation and computational biology-
Computational complexity-
Computer theorem-proving-
Concurrency and distributed process theory-
Cryptographic theory-
Data base theory-
Decision problems in logic-
Design and analysis of algorithms-
Discrete optimization and mathematical programming-
Inductive inference and learning theory-
Logic & constraint programming-
Program verification & model checking-
Probabilistic & Quantum computation-
Semantics of programming languages-
Symbolic computation, lambda calculus, and rewriting systems-
Types and typechecking
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
