A naive suffix tree
Project description
This implementation:
works with any Python iterable, not just strings, if the items are hashable,
values simplicity over speed,
is a generalized suffix tree for sets of iterables ([Gusfield1997] §6.4),
can convert the tree to .dot if the items convert to strings,
This implementation mostly follows [Gusfield1997] Chapter 6, with following differences:
indices are 0-based (a Python convention),
end indices point one element beyond the end (also a Python convention).
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
suffix-tree-0.0.2.tar.gz
(9.2 kB
view details)
Built Distribution
File details
Details for the file suffix-tree-0.0.2.tar.gz.
File metadata
- Download URL: suffix-tree-0.0.2.tar.gz
- Upload date:
- Size: 9.2 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | c7dd097f235467c3a9a2c2ac46bb7e1c94ca9a4cd3266922ee561de207038f81 |
|
| MD5 | d5aa055debdfdf2c8609e8ee31183798 |
|
| BLAKE2b-256 | b9d7156834e0c9f42c4efce6dc086cf4a403b5eabb6a4928c5b7b7b30fc4014e |
File details
Details for the file suffix_tree-0.0.2-py3-none-any.whl.
File metadata
- Download URL: suffix_tree-0.0.2-py3-none-any.whl
- Upload date:
- Size: 10.9 kB
- Tags: Python 3
- Uploaded using Trusted Publishing? No
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | c5b9d45e882d1dd39e50fc9928c1c167eada186c9d0fe778cd90c642461a7d25 |
|
| MD5 | 47224beaa71d2b549f2c0685226c74b8 |
|
| BLAKE2b-256 | 67f68170b6b58d053e3d7519dde43842845eb8425cd2b436910a10e3a0711f70 |
