-
MSufSort: MSufSort is a lightweight/high speed suffix sorting algorithm.
Version 3.1.1 Beta is now available!
This beta version has major enhancements in both the induction sorting and tandem repeat sorting algorithms,
making version 3.1.1 amazing robust on all types of data. The beta version allocates 6N space usage however it typically uses only
5.2N space on average with 6N being the worst case. The demo demonstrates the Suffix Array, BWT and reverse-BWT features.
The non-beta release should be very soon. A DLL for 3.1beta is now available as well.
-
IntroSort: Introsort is a hybrid of quicksort and
heapsort. It was first introduced by David R. Musser in the paper
'Introspective Sorting and Selection Algorithms.' The version I have written includes ternary
quicksort with insertion sort for small partitions. It is much faster than any other generic sort
which I have seen ... including STL implementations of Introsort.
-
Burrows/Wheeler Transform: A demonstration of the Burrows/Wheeler
Transform implemented as a C++ class using the MSufSort algorithm.
|