Metadata-Version: 2.1
Name: suffix-tree
Version: 0.0.2
Summary: A naive suffix tree
Home-page: https://github.com/cceh/suffix-tree
Author: Marcello Perathoner
Author-email: marcello@perathoner.de
License: UNKNOWN
Keywords: suffix,tree,suffixtree
Platform: UNKNOWN
Classifier: Programming Language :: Python :: 3
Classifier: Operating System :: OS Independent
Classifier: License :: OSI Approved :: GNU General Public License v3 (GPLv3)
Classifier: Intended Audience :: Developers
Classifier: Intended Audience :: Information Technology
Classifier: Intended Audience :: Science/Research
Classifier: Topic :: Scientific/Engineering :: Bio-Informatics
Classifier: Topic :: Text Processing :: Indexing
Classifier: Topic :: Text Processing :: Linguistic
Description-Content-Type: text/x-rst

===========================
 A Generalized Suffix Tree
===========================

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).

.. [Gusfield1997] Gusfield, Dan.  Algorithms on strings, trees, and sequences.
                  1997.  Cambridge University Press.


