To run: python suffix.py
A Suffix tree implementation in python supporting the following operations:
- List all the occurrences of a query-string in the set of documents.
- List only the first occurrence of a given query-string in every document. If the query-string is not present, find the first occurrence of the longest substring of the query-string.
- For a given query-string (query of words), list the documents ranked by the relevance.
Professor Ben Langmead's implementation was used as reference during the implementation. Resource: http://www.cs.jhu.edu/~langmea/resources/lecture_notes/suffix_trees.pdf