The Burrows-Wheeler Transform is a string transformation that plays a fundamental role for the design of self-indexing compressed data structures. Over the years, researchers have successfully extended this transformation outside the domains of strings. However, efforts to find non-trivial alternatives of the original, now 25 years old, Burrows-Wheeler string transformation have met limited success. In this paper we bring new lymph to this area by introducing a whole new family of transformations that have all the “myriad virtues” of the BWT: they can be computed and inverted in linear time, they produce provably highly compressible strings, and they support linear time pattern search directly on the transformed string. This new family is a special case of a more general class of transformations based on context adaptive alphabet orderings, a concept introduced here. This more general class includes also the Alternating BWT, another invertible string transforms recently introduced in connection with a generalization of Lyndon words
|Titolo della pubblicazione ospite||Leibniz International Proceedings in Informatics, LIPIcs|
|Numero di pagine||12|
|Stato di pubblicazione||Published - 2019|
Serie di pubblicazioni
|Nome||LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS|
All Science Journal Classification (ASJC) codes
Sciortino, M., Giancarlo, R., Rosone, G., & Manzini, G. (2019). A new class of searchable and provably highly compressible string transformations. In Leibniz International Proceedings in Informatics, LIPIcs (pagg. 1-12). (LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS).