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] §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.1.tar.gz
(8.8 kB
view details)
Built Distribution
File details
Details for the file suffix-tree-0.0.1.tar.gz.
File metadata
- Download URL: suffix-tree-0.0.1.tar.gz
- Upload date:
- Size: 8.8 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | 52a08cd2019c2fe1cc93f2a9821195bc3d8899a51745ba82bef25c928a4112bb |
|
| MD5 | 88e6911d79e85e95d52beb421d5e315e |
|
| BLAKE2b-256 | 1f4357d0404deaa51fbcb3f7b2f9b658076f80f651ddce249db60fe6f280b6e8 |
File details
Details for the file suffix_tree-0.0.1-py3-none-any.whl.
File metadata
- Download URL: suffix_tree-0.0.1-py3-none-any.whl
- Upload date:
- Size: 10.4 kB
- Tags: Python 3
- Uploaded using Trusted Publishing? No
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | ab20a13c9baf19f4e4167e11fd86dc603329cb1d968fde6cd58a78cedd4b27ab |
|
| MD5 | 3df9c85f835a0585509d9af7feed5a20 |
|
| BLAKE2b-256 | eaed59ccf912410623a58f1ba8f4b8bd7864cfef054b848ede97d3b2ce4e3fdc |
