SuffixStructures: Suffix array construction
Suffix array construction in Haskell. Currently, only a naive method is provided. More advanced construction methods might follow.
[Skip to Readme]
Flags
Manual Flags
| Name | Description | Default |
|---|---|---|
| llvm | use llvm backend | Disabled |
Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info
Downloads
- SuffixStructures-0.0.1.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 0.0.1.0 |
|---|---|
| Change log | changelog.md |
| Dependencies | aeson (>=0.8 && <0.9), base (>=4.7 && <4.9), binary (>=0.7 && <0.8), bytestring (>=0.10 && <0.11), cereal (>=0.4 && <0.5), cmdargs (>=0.10 && <0.11), containers (>=0.5 && <0.6), data-default-class (==0.0.1), ListLike (>=4.1.0.0 && <4.3), primitive (>=0.5 && <0.7), SuffixStructures, vector (>=0.10 && <0.11), vector-algorithms (>=0.6 && <0.7), vector-binary-instances (>=0.2 && <0.3) [details] |
| Tested with | ghc ==7.8.4, ghc ==7.10.1 |
| License | BSD-3-Clause |
| 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 repo | head: git clone git://github.com/choener/SuffixStructures |
| Uploaded | by ChristianHoener at 2015-05-07T17:37:14Z |
| Distributions | |
| Executables | mkesa |
| Downloads | 1104 total (0 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2015-05-07 [all 1 reports] |
Readme for SuffixStructures-0.0.1.0
[back to package description]OrderedBits
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