OCaml implementations of succinct bitvector rank/select – in constant and logarithmic (via binary search) time, respectively – and wavelet trees, wrapping the Bitv library.
I suggest using OPAM to install OCaml, OCamlfind, and Bitv.
-
Notifications
You must be signed in to change notification settings - Fork 0
dymil/wavelet-trees
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
OCaml implementations of succinct bitvector rank/select and wavelet trees, wrapping the bitv library
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published