This repository contains the benchmark tool used for the experimental evaluation of our new implementation of Baier's algorithm! Feel free to check out our paper, or the implementation of the algorithm:
Paper: https://doi.org/10.4230/LIPIcs.ESA.2021.15
Implementation: https://github.com/jonas-ellert/gsaca-double-sort
If you use our algorithm, please cite us:
@InProceedings{bertram_et_al:LIPIcs.ESA.2021.15,
author = {Bertram, Nico and Ellert, Jonas and Fischer, Johannes},
title = {{Lyndon Words Accelerate Suffix Sorting}},
booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)},
pages = {15:1--15:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-204-4},
ISSN = {1868-8969},
year = {2021},
volume = {204},
editor = {Mutzel, Petra and Pagh, Rasmus and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/14596},
URN = {urn:nbn:de:0030-drops-145961},
doi = {10.4230/LIPIcs.ESA.2021.15},
annote = {Keywords: Suffix array, suffix sorting, Lyndon words, string algorithms}
}