The SuffixStructures package

[ Tags: benchmark, 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]

Properties

Versions 0.0.1.0
Change log changelog.md
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.1.0.0 && <4.3), primitive (>=0.5 && <0.7), SuffixStructures, vector (==0.10.*), vector-algorithms (==0.6.*), vector-binary-instances (==0.2.*) [details]
License BSD3
Copyright Christian Hoener zu Siederdissen, 2014 - 2015
Author Christian Hoener zu Siederdissen
Maintainer choener@bioinf.uni-leipzig.de
Category Data, Data Structures
Home page http://www.bioinf.uni-leipzig.de/~choener/
Source repository head: git clone git://github.com/choener/SuffixStructures
Uploaded Thu May 7 17:37:14 UTC 2015 by ChristianHoener
Distributions NixOS:0.0.1.0
Executables mkesa
Downloads 227 total (2 in the last 30 days)
Rating 0.0 (0 ratings) [clear rating]
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2015-05-07 [all 1 reports]
Hackage Matrix CI

Modules

[Index]

Flags

NameDescriptionDefaultType
llvm

use llvm backend

DisabledManual

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

Downloads

Maintainer's Corner

For package maintainers and hackage trustees


Readme for SuffixStructures-0.0.1.0

[back to package description]

OrderedBits

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.

Contact

Christian Hoener zu Siederdissen choener@bioinf.uni-leipzig.de Leipzig University, Leipzig, Germany