Wheeler图上的Tunnel
Tunneling on Wheeler Graphs
摘要:
Burrows-Wheeler变换(BWT)是数据压缩和紧凑索引数据结构设计中的一项重要技术。它已经从单个字符串推广到字符串的集合和一些类别的标记有向图,如tries和de Bruijn图。重复数据集的BWT通常可以使用游程压缩进行压缩,但最近Baier(CPM 2018)描述了如何使用他称为隧道的想法进一步压缩它们。在本文中,我们表明,隧道BWT仍然可以用于索引和扩展隧道的惠勒图的BWT,一个框架,其中包括所有上述概括。
英文摘要:
The Burrows-Wheeler Transform (BWT) is an important technique both in data compression and in the design of compact indexing data structures. It has been generalized from single strings to collections of strings and some classes of labeled directed graphs, such as tries and de Bruijn graphs. The BWTs of repetitive datasets are often compressible using run-length compression, but recently Baier (CPM 2018) described how they could be even further compressed using an idea he called tunneling. In this paper we show that tunneled BWTs can still be used for indexing and extend tunneling to the BWTs of Wheeler graphs, a framework that includes all the generalizations mentioned above.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。