libdivsufsort swMATH ID: 38865 Software Authors: Yuta Mori Description: libdivsufsort is a software library that implements a lightweight suffix array construction algorithm. This library provides a simple and an efficient C API to construct a suffix array and a Burrows-Wheeler transformed string from a given string over a constant-size alphabet. The algorithm runs in O(n log n) worst-case time using only 5n+O(1) bytes of memory space, where n is the length of the string. Homepage: https://github.com/y-256/libdivsufsort/ Source Code: https://github.com/y-256/libdivsufsort/ Related Software: Zstandard; FRESCO; Brotli; r-index; LZ77; GitHub Cited in: 3 Publications all top 5 Cited by 7 Authors 1 Kärkkäinen, Juha 1 Kempa, Dominik 1 Kosolobov, Dmitry 1 Navarro, Gonzalo 1 Puglisi, Simon J. 1 Smyth, William F. 1 Valenzuela, Daniel Cited in 3 Serials 1 European Journal of Combinatorics 1 Algorithmica 1 Mathematics in Computer Science Cited in 1 Field 3 Computer science (68-XX) Citations by Year