There are much faster SA construction algorithms than skew (check out divsufsort). The O(n) algorithms using induced sorting are also likely much faster than this work. The constants of recent O(n) algorithms are very low.<p>here a link for some state-of-the-art benchmarks of non-parallel SA construction algorithms: <a href="https://github.com/y-256/libdivsufsort/blob/wiki/SACA_Benchmarks.md" rel="nofollow">https://github.com/y-256/libdivsufsort/blob/wiki/SACA_Benchm...</a><p>there also now exist linear speedup parallel SA construction algorithms.