About JSuffixArrays
-------------------
This project provides the implementation of a number of algorithms for computing
Suffix Arrays over sequences of symbols of arbitrary size (not only strings).
Suffix arrays are an extremely powerful data structure, useful in many areas of
computer science. The theoretical bounds for computing suffix arrays is, just as with
suffix trees, O(n). Their practical implementation is in many cases much faster because
of data access locality.
This project was started because not many suffix arrays algorithms have been ported
from the C (pointers, pointers) world and out of shear curiosity to see which algorithm
will perform best.
Development
-----------
mvn clean # Clean the working copy.
mvn install -DskipTests # Quick compile, no tests.
mvn -Prelease # Release mode (javadocs, sources, zip/tgz bundles, gpg signing).
# Results in: target/*.tgz
Release
-------
mvn -Prelease clean deploy # Snapshot or release deploy to sonatype [requires proper setup in settings.xml]