2026-07-26T02:16:08Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:10495 2024-03-06T10:45:52Z ddc:004 open_access

Linking BWT and XBW via Aho-Corasick Automaton: Applications to Run-Length Encoding Cazaux, Bastien Rivals, Eric Data Structure Algorithm Aho-Corasick Tree compression RLE The boom of genomic sequencing makes compression of sets of sequences inescapable. This underlies the need for multi-string indexing data structures that helps compressing the data. The most prominent example of such data structures is the Burrows-Wheeler Transform (BWT), a reversible permutation of a text that improves its compressibility. A similar data structure, the eXtended Burrows-Wheeler Transform (XBW), is able to index a tree labelled with alphabet symbols. A link between a multi-string BWT and the Aho-Corasick automaton has already been found and led to a way to build a XBW from a multi-string BWT. We exhibit a stronger link between a multi-string BWT and a XBW by using the order of the concatenation in the multi-string. This bijective link has several applications: first, it allows one to build one data structure from the other; second, it enables one to compute an ordering of the input strings that optimises a Run-Length measure (i.e., the compressibility) of the BWT or of the XBW. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Bastien Cazaux and Eric Rivals 2019 Is Part Of LIPIcs, Volume 128, 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CPM.2019.24 urn:nbn:de:0030-drops-104955 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2019.24 eng https://creativecommons.org/licenses/by/3.0/legalcode