A naive suffix tree
Project description
pip install suffix-treeThis implementation:
works with any Python iterable, not just strings, if the items are hashable,
is a generalized suffix tree for sets of iterables,
uses Ukkonen’s algorithm to build the tree in linear time,
can convert the tree to .dot if the items convert to strings,
This implementation follows [Gusfield1997] Chapter 6, with some differences:
indices are 0-based (a Python convention),
end indices point one element beyond the end (also a Python convention).
PyPi: https://pypi-hypernode.com/project/suffix-tree/
Gusfield, Dan. Algorithms on strings, trees, and sequences. 1997. Cambridge University Press.
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
Built Distribution
File details
Details for the file suffix-tree-0.0.3.tar.gz.
File metadata
- Download URL: suffix-tree-0.0.3.tar.gz
- Upload date:
- Size: 13.7 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | 39459196d1850dd47913ea95cf327f277a86a91c1a29c4641697422345e21d33 |
|
| MD5 | 4040b7d01082f93e2dde0bb49d785592 |
|
| BLAKE2b-256 | 0e324a2dae15e97ad4c84f051e6243ddbdeef37fec971df1b50d789bc0a7f77f |
File details
Details for the file suffix_tree-0.0.3-py3-none-any.whl.
File metadata
- Download URL: suffix_tree-0.0.3-py3-none-any.whl
- Upload date:
- Size: 17.9 kB
- Tags: Python 3
- Uploaded using Trusted Publishing? No
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | 922d659301186884389025f68903b7ff55dd39be852974082fe38fd318ad19ed |
|
| MD5 | 962c0393149a8947d2faec5c53ab9520 |
|
| BLAKE2b-256 | 48972c62a753907dfb8a4d225dd6df6cb27fc485ca7a388ffb4b0b4f3d52b28e |
