SuffixStructures: Suffix array construction

[ bsd3, data, data-structures, library, program ] [ Propose Tags ]

Suffix array construction in Haskell. Currently, only a naive method is provided. More advanced construction methods might follow.

[Skip to Readme]
Versions [RSS] [faq]
Change log
Dependencies aeson (==0.8.*), base (>=4.7 && <4.9), binary (==0.7.*), bytestring (==0.10.*), cereal (==0.4.*), cmdargs (==0.10.*), containers (==0.5.*), data-default-class (==0.0.1), ListLike (>= && <4.3), primitive (>=0.5 && <0.7), SuffixStructures, vector (==0.10.*), vector-algorithms (==0.6.*), vector-binary-instances (==0.2.*) [details]
License BSD-3-Clause
Copyright Christian Hoener zu Siederdissen, 2014 - 2015
Author Christian Hoener zu Siederdissen
Category Data, Data Structures
Home page
Source repo head: git clone git://
Uploaded by ChristianHoener at 2015-05-07T17:37:14Z
Distributions NixOS:
Executables mkesa
Downloads 941 total (9 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2015-05-07 [all 1 reports]



Manual Flags


use llvm backend

Automatic Flags

Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info


Maintainer's Corner

For package maintainers and hackage trustees


Readme for SuffixStructures-

[back to package description]


Build Status

A collection of suffix structures. While we currently only provide a naive construction method, this method should still be acceptably fast in many cases up to around 100M characters -- assuming the input sequence is well behaved in some sense.


Christian Hoener zu Siederdissen Leipzig University, Leipzig, Germany