Linear indexing for all strings under all internal nodes in suffix trees

Suffix trees are fundamental data structure in stringology. In this work, we introduce two algorithms that index all strings/suffixes under all internal nodes in suffix tree in linear time and space. These indexes can contribute in resolving several strings problems such as DNA sequence analysis and approximate pattern matching problems.