@InProceedings{giancarlo_et_al:LIPIcs.CPM.2019.12,
author = {Giancarlo, Raffaele and Manzini, Giovanni and Rosone, Giovanna and Sciortino, Marinella},
title = {{A New Class of Searchable and Provably Highly Compressible String Transformations}},
booktitle = {30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019)},
pages = {12:1--12:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-103-0},
ISSN = {1868-8969},
year = {2019},
volume = {128},
editor = {Pisanti, Nadia and P. Pissis, Solon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2019.12},
URN = {urn:nbn:de:0030-drops-104833},
doi = {10.4230/LIPIcs.CPM.2019.12},
annote = {Keywords: Data Indexing and Compression, Burrows-Wheeler Transformation, Combinatorics on Words}
}