Suffix Array for all-substring search
Project description
sufarray: implementation of suffix array
It uses prefix doubling for calculating the suffix array, which is O(n log n) time. When searching for all occurrences of a string, it takes O(log n) time. Further occurrences takes constant time.
At present the implementation is Python only. This has the drawback that the speed is not comparable with those of other languages.
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
sufarray_kkto-0.1.tar.gz
(4.1 kB
view hashes)
Built Distribution
Close
Hashes for sufarray_kkto-0.1-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 472239a97951f1964fb1582a75e5516fd9a7e14261f5225319177d79d8080730 |
|
MD5 | fec961fb8981f5ba54ab880a6ca7bfc4 |
|
BLAKE2b-256 | 72f257f5ad7a694f4f22be3f768b56d69b856c03f392e2787065f8a1b6368121 |