suffix-trees
Suffix trees, generalized suffix trees and string processing methods
Decision gist · record as of 2026-08-14
Yes, if you need a reference implementation for learning suffix trees or have a simple, non-critical use case for substring matching. No, if you require active maintenance or production-grade performance guarantees. The package works but is abandoned, so evaluate whether its lack of updates aligns with your project's stability requirements.AI-flagged interpretation of the facts on this page — verify before relying
Before you install
- Installation is straightforward with no runtime dependencies, but the package is abandoned as of 2020 with no recent maintenance.
- The repository is archived and the last commit was 2020-08-05, so expect no bug fixes or compatibility updates.
License · maintenance · safety
MIT (permissive) — Licensed under MIT, a permissive license that allows free use, modification, and distribution with minimal restrictions, making it safe to use in most projects.
last release 2020-04-10 (2317 days) · last repo commit 2020-08-05 · 126 stars · archived
0 known vulnerabilities (OSV.dev, 2026-08-14) · 90,566 downloads/mo, #13,575 on PyPI
Alternatives
Verify before relying
pip install suffix-trees
from suffix_trees import STree
st = STree.STree("abcdefghab")
print(st.find("abc")) # 0
print(st.find_all("ab")) # [0, 8]- Whether the implementation handles edge cases and large datasets efficiently.
- Compatibility with Python versions beyond 3.8, given the package is abandoned.
- Performance characteristics and memory usage for typical use cases.
What it is and what it does
suffix-trees provides a Python implementation of suffix trees and generalized suffix trees, which are data structures that enable fast substring searching and pattern matching. You create a tree from a string or list of strings, then query it to find substrings, locate all occurrences of a pattern, or compute properties like the longest common substring across multiple strings.
The package is classified as Alpha and has been unmaintained since 2020. It has no external runtime dependencies, making installation simple, but its abandonment means there will be no fixes for compatibility issues with newer Python versions or performance improvements. It is suitable for educational purposes or as a reference implementation, but production use should consider whether the lack of maintenance poses a risk for your use case.
Use it for
- Find all occurrences of a substring within a text string using the find_all method.
- Compute the longest common substring across multiple strings using generalized suffix trees.
- Build a suffix tree index for repeated substring searches on a fixed text.
- Implement text processing algorithms that rely on efficient substring matching.
- Educational exploration of suffix tree data structures and their applications.
Worth the install?
AI-flagged interpretation of the facts on this page. Verify before relying on it.
Yes, if you need a reference implementation for learning suffix trees or have a simple, non-critical use case for substring matching.
No, if you require active maintenance or production-grade performance guarantees. The package works but is abandoned, so evaluate whether its lack of updates aligns with your project's stability requirements.
Install
suffix-trees on PyPI
Before you install
Installation is straightforward with no runtime dependencies, but the package is abandoned as of 2020 with no recent maintenance. The repository is archived and the last commit was 2020-08-05, so expect no bug fixes or compatibility updates.
License in practice
Licensed under MIT, a permissive license that allows free use, modification, and distribution with minimal restrictions, making it safe to use in most projects.
Quickstart
pip install suffix-trees
from suffix_trees import STree
st = STree.STree("abcdefghab")
print(st.find("abc")) # 0
print(st.find_all("ab")) # [0, 8]Verify before relying
- Whether the implementation handles edge cases and large datasets efficiently.
- Compatibility with Python versions beyond 3.8, given the package is abandoned.
- Performance characteristics and memory usage for typical use cases.
Package facts
| License | MIT permissive |
| Python support | Not specified |
| Install friction | Low. Pure-Python wheel |
| Runtime dependencies | None |
| Maintenance | Abandoned 2,317 days since the last release |
| Last repo commit | repository archived |
| First released | |
| Downloads | 90,566 / month, #13,575 on PyPI 30-day window, as of 2026-08-14 |
| Known vulnerabilities | None known OSV.dev, checked 2026-08-14 |
| Classifiers | Development Status :: 3 - AlphaProgramming Language :: Python :: 3Programming Language :: Python :: 3.5Programming Language :: Python :: 3.6Programming Language :: Python :: 3.7Programming Language :: Python :: 3.8 |
Evidence: suffix_trees-0.3.0-py3-none-any.whl
Tags
Let your AI agent find packages like this
Example. Real query, live index.
You found this page by searching. An agent finds it by wishing: SkillFed indexes 14,416 PyPI packages by what they can do, searchable in plain language.
wish › “suffix tree implementation”
- suffix-treesImplements suffix trees and generalized suffix trees in Python,…
- tldextractAccurately extracts subdomain, domain, and public suffix from URLs…
- publicsuffixlistParses the Public Suffix List to extract the public and private…
Give your agent the search over MCP, or paste the wish link into any chat.
More Text Processing packages
A drop-in replacement for Python's standard `re` module that adds advanced regex features like nested sets, fuzzy matching, lookaround in conditionals, and full Unicode case-folding while maintaining backward compatibility.
pyparsing provides a library for building text parsers directly in Python code using composable grammar classes, handling quoted strings, whitespace variation, and embedded comments without regex or lex/yacc.
Install it if you need to parse text or define grammars programmatically.
fonttools manipulates font files in multiple formats (TrueType, OpenType, AFM, Type 1, Mac-specific) and includes TTX, a tool to convert fonts to and from XML text format.
Install it if you need to read, write, or manipulate fonts programmatically or via the TTX command-line tool.
Docutils converts plaintext documentation in reStructuredText format into multiple output formats including HTML, XML, and LaTeX using a modular processing system.
RapidFuzz provides fast fuzzy string matching using Levenshtein Distance and related metrics, implemented mostly in C++ with Python bindings for rapid similarity scoring and approximate string matching.
Install it if you need fuzzy string matching; it's a solid replacement for FuzzyWuzzy with better licensing and performance.
tinycss2 parses CSS strings into token and block objects, and generates CSS strings from those objects, following the CSS Syntax Level 3 specification without enforcing specific properties or values.
Install it if your project requires CSS tokenization or syntax manipulation.
See also strsimpy · pylcs · ahocorapy · pfzy · greenery · Distance · stringzilla · red-black-tree-mod · retrie · treelib