My favorites | Sign in
Project Home Wiki Issues Source
Project Information
Members

Be gone with the other arrays!

The details are described in the following preprint: http://arxiv.org/abs/1310.1448

The runtime comparison for several algorithms, KKP1, 2, 3, LZISA6s, LZScan is put here. (The competitor's implementations are here )

The comparison of peak memory consumptions of these algorithms is put here.

We only write the runtime of divsufsort for the construction of Suffix Arrays, and all algorithms based on Suffix Arrays use divsufsort and includes the runtime of divsufsort in each runtimes.

Note, LZISA6s caused bus errors for some files, and we set lager value than 999 for the runtime of it in the case. We set parameter of LZScan so that LZScan run to use memory of 6N bytes, 5N bytes, and 4N bytes, we call each runtime of them LZScan6, 5, 4 respectively. Since it was hard to control the memory consumption accurately, real memory consumptions may be unexpected value. Please see the comparison of peak memory consumptions for all algorithms.

Powered by Google Project Hosting