Skip to main content

A Generalized Suffix Tree for any iterable, with Lowest Common Ancestor retrieval

Project description

A Generalized Suffix Tree for any Python iterable, 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 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,
  • does constant-time Lowest Common Ancestor retrieval,
  • outputs the tree as GraphViz .dot file.

Three different builders have been implemented:

  • one that follows Ukkonen’s original paper ([Ukkonen1995]),
  • one that follows Gusfield’s variant ([Gusfield1997]),
  • and one simple naive algorithm.

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

[Ukkonen1995]Ukkonen, Esko. On-line construction of suffix trees. 1995. Algorithmica 14:249-60. http://www.cs.helsinki.fi/u/ukkonen/SuffixT1withFigs.pdf
[Gusfield1997]Gusfield, Dan. Algorithms on strings, trees, and sequences. 1997. Cambridge University Press.

Project details


Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Files for suffix-tree, version 0.0.7
Filename, size File type Python version Upload date Hashes
Filename, size suffix_tree-0.0.7-py3-none-any.whl (37.1 kB) File type Wheel Python version py3 Upload date Hashes View
Filename, size suffix-tree-0.0.7.tar.gz (20.0 kB) File type Source Python version None Upload date Hashes View

Supported by

Pingdom Pingdom Monitoring Google Google Object Storage and Download Analytics Sentry Sentry Error logging AWS AWS Cloud computing DataDog DataDog Monitoring Fastly Fastly CDN DigiCert DigiCert EV certificate StatusPage StatusPage Status page