SACA Benchmark

This repository contains the following C/C++ implementations of suffix array construction algorithms (SACAs).

There now exists the project SACABench that contains most of these algorithms and allows to easliy build, run, and benchmark them.

Name	Publication	Author(s)	Year	License
BRP2	An Incomplex Algorithm for Fast Suffix Array Construction	K.-B. Schürmann and J. Stoye	2005	GPL v2
DC3	Simple Linear Work Suffix Array Construction	J. Kärkkäinen and P. Sanders	2003	n/a
deep-shallow	Engineering a Lightweight Suffix Array Construction Algorithm	G. Manzini and P. Ferragina	2002	GPL v2
gsaca	Linear-time Suffix Sorting – A New Approach for Suffix Array Construction	U. Baier	2016	MIT
libdivsufsort	-	Y. Mori	2011	MIT
qsufsort	Faster Suffix Sorting	N. J. Larsson and K. Sadakane	1999	own
sa-ds	Two Efficient Algorithms for Linear Time Suffix Array Construction	G. Nong	2012	n/a
sa-is	Two Efficient Algorithms for Linear Time Suffix Array Construction	G. Nong	2011	n/a
SACA-K	Practical Linear-Time O(1)-Workspace Suffix Sorting for Constant Alphabets	G. Nong	2011/13	n/a
sais-lite	-	Y. Mori	2010	MIT
gsa-is	Inducing Enhanced Suffix Arrays for String Collections	F. A. Louza, S. Gog and G. P. Telles	2017	MIT
msufsort	(version 4 is currently in development)	M. Maniscalco	2017	MIT

Please note that all those files are licensed under their respective license (if available). I merely collected them to create a benchmark.

If you know of any other publicly available SACA please send me a mail.