yuta mori's code: https://github.com/

Yes, libsais is based on induced sorting <a href="https://www.google.com/search?q=SA-I

Yes, libsais is based on induced sorting <a href="https://www.google.com/

Is SA-IS means using induce sort for suffix array? yuta mori has Open source code of SA-IS about libsais HOT 2 CLOSED

ilyagrebnov commented on July 22, 2024

Is SA-IS means using induce sort for suffix array? yuta mori has Open source code of SA-IS

from libsais.

Comments (2)

IlyaGrebnov commented on July 22, 2024

Yes, libsais is based on induced sorting SA-IS algorithm. Yuta Mori implementation for this algorithm could be found here .

Note, libdivsufsort you quoted above is not based on SA-IS algorithm. You could find description of algorithm here and it only need O(1) bytes of additional memory (256KB to be exact) which is optimal for this class of algorithms which do not use external memory.

from libsais.

Daisy-gj commented on July 22, 2024

Yes, libsais is based on induced sorting SA-IS algorithm. Yuta Mori implementation for this algorithm could be found here .

Note, libdivsufsort you quoted above is not based on SA-IS algorithm. You could find description of algorithm here and it only need O(1) bytes of additional memory (256KB to be exact) which is optimal for this class of algorithms which do not use external memory.

Thanks! I will read this paper.

from libsais.

Recommend Projects