suffix-tree

py39 py310 py311 py312 pypy39 coverage

A Generalized Suffix Tree for any Python sequence, with Lowest Common Ancestor retrieval.

pip install suffix-tree

>>> from suffix_tree import Tree

>>> tree = Tree({"A": "xabxac"})
>>> tree.find("abx")
True
>>> tree.find("abc")
False

This suffix tree:

works with any Python sequence, not just strings, if the items are hashable,
is a generalized suffix tree for sets of sequences,
is implemented in pure Python,
builds the tree in time proportional to the length of the input,
does constant-time Lowest Common Ancestor retrieval.

Being implemented in Python this tree is not very fast nor memory efficient. The building of the tree takes time proportional to the length of the string of symbols. The query time is proportional to the length of the query string.

To get the best performance turn the python optimizer on: python -O.

Documentation: https://cceh.github.io/suffix-tree/

PyPi: https://pypi.org/project/suffix-tree/

Usage examples:

>>> from suffix_tree import Tree
>>> tree = Tree()
>>> tree.add(1, "xabxac")
>>> tree.add(2, "awyawxawxz")
>>> tree.find("abx")
True
>>> tree.find("awx")
True
>>> tree.find("abc")
False

>>> tree = Tree({"A": "xabxac", "B": "awyawxawxz"})
>>> tree.find_id("A", "abx")
True
>>> tree.find_id("B", "abx")
False
>>> tree.find_id("B", "awx")
True

>>> tree = Tree(
...     {
...         "A": "sandollar",
...         "B": "sandlot",
...         "C": "handler",
...         "D": "grand",
...         "E": "pantry",
...     }
... )
>>> for k, length, path in tree.common_substrings():
...     print(k, length, path)
...
2 4 s a n d
3 3 a n d
4 3 a n d
5 2 a n

>>> tree = Tree({"A": "xabxac", "B": "awyawxawxz"})
>>> for C, path in sorted(tree.maximal_repeats()):
...     print(C, path)
...
1 a w
1 a w x
2 a
2 x
2 x a

Release files for suffix-tree 0.1.2

For a detailed explanation of source distributions (sdists) and built distributions (wheels), please see the package formats documentation.

Source distribution (sdist)

Source distribution for suffix-tree 0.1.2
File	Size	Uploaded
suffix_tree-0.1.2.tar.gz	686.0 kB	Oct 9, 2023	Details

Built distribution (wheel)

Table of built distributions (wheels) for suffix-tree 0.1.2
File	Interpreter	ABI	Platform	Reset
suffix_tree-0.1.2-py3-none-any.whl 32.6 kB Oct 9, 2023	Python 3	none	any	Details

Total release size: 718.6 kB

Release files / suffix_tree-0.1.2.tar.gz

Download URL	suffix_tree-0.1.2.tar.gz
Size	686.0 kB
Tags	Source
SHA-256 checksum How to use checksums	`e5a927d205956c0161ed4fc90959e55326f67bccea1291fa476b408f347d92ef`
BLAKE2b-256 checksum How to use checksums	`32eb932d92d37e56629d1a9fb5126cd07d3bdc5166a6ea654fb06d4e83961c93`
Upload date	Oct 9, 2023
Uploaded using Trusted Publishing? What is trusted publishing?	No
Uploaded via	`twine/4.0.2 CPython/3.11.6`

Release files / suffix_tree-0.1.2-py3-none-any.whl

Download URL	suffix_tree-0.1.2-py3-none-any.whl
Size	32.6 kB
Tags	Python 3
SHA-256 checksum How to use checksums	`c7f01f9bf16f88eed830d6be97b3448648c48ea763cf0092a1f29dccd2b13862`
BLAKE2b-256 checksum How to use checksums	`a6b08f6adff523678f5cf23da20f6b3a00727c97287dca39746f2ffdb4ef1b06`
Upload date	Oct 9, 2023
Uploaded using Trusted Publishing? What is trusted publishing?	No
Uploaded via	`twine/4.0.2 CPython/3.11.6`