. Author manuscript; available in PMC: 2015 Jul 1.

Published in final edited form as: J Discrete Algorithms (Amst). 2014 Jul 1;27:21–28. doi: 10.1016/j.jda.2014.03.001

Algorithm SA1.

Sort P₁, P₂, …, P_n using radix sort;

The above sorting partitions the P_i’s into buckets where equal ℓ-mers are in the same bucket;

Let these buckets be B₁, B₂, …, B_m where m ≤ n;

for i := 1 to m do

if |B_i| > 1 then sort the suffixes corresponding to the ℓ-mers in B_i using any relevant algorithm;