SuffixTree is a Python library for generating suffix trees and generalized suffix trees. also, there are helpers for pattern searching, finding the longest common substring, the longest repeated substring, and the longest palindromic substring.
For using TestGUI you need to install docker and docker-compose first. Get Docker
For GUI testing If you have installed docker and docker compose do the following:
./run startor
docker-compose upand if you do not have docker and docker compose
python -m pip install -r requirements.txt && python app.pythen you could open http://localhost:5000 in your browser and continue.
from suffixTree.suffixTree import SuffixTree
from suffixTree.helpers.searchPattern import SearchPattern
from suffixTree.helpers.lrs import LRS
from suffixTree.helpers.lcs import LCS
from suffixTree.helpers.lps import LPS
tree = SuffixTree(["Geeksatb", "batl"], True)
search = SearchPattern(tree, "at")
print(search.search())
""" Output
{'1': [1], '0': [5]}
"""
tree = SuffixTree(["abcpqrabcpqpq"], True)
lrs = LRS(tree, 2)
print(lrs.find())
""" Output
abcpq
"""
tree = SuffixTree(["xabxac", "abcabxabcd"], True)
lcs = LCS(tree, 2)
print(lcs.find())
""" Output
abxa
"""
tree = SuffixTree(["xababayz"], True, True)
lps = LPS(tree)
print(lps.find())
""" Output
ababa
"""Pull requests are welcome. For major changes, please open an issue first to discuss what you would like to change.
Please make sure to update tests as appropriate.