Jason W. Bentley, Daniel Gibney, Sharma V. Thankachan. On the Complexity of BWT-Runs Minimization via Alphabet Reordering. In Fabrizio Grandoni 0001, Grzegorz Herman, Peter Sanders 0001, editors, 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference). Volume 173 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. [doi]
@inproceedings{BentleyGT20,
title = {On the Complexity of BWT-Runs Minimization via Alphabet Reordering},
author = {Jason W. Bentley and Daniel Gibney and Sharma V. Thankachan},
year = {2020},
doi = {10.4230/LIPIcs.ESA.2020.15},
url = {https://doi.org/10.4230/LIPIcs.ESA.2020.15},
researchr = {https://researchr.org/publication/BentleyGT20},
cites = {0},
citedby = {0},
booktitle = {28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)},
editor = {Fabrizio Grandoni 0001 and Grzegorz Herman and Peter Sanders 0001},
volume = {173},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-162-7},
}