THE USE OF SPARSE SUFFIX TREE FOR WORD PROCESSING TASKS
Efficient algorithms for processing of strings and sequences required in many practical problems. Therefore, this area is being studied and developed. Find the longest common substring is one of the classical problems in the strings processing. To solve this problem, we propose to use sparse suffix trees and give a description of the algorithm. This approach allows to process data much larger than with conventional suffix trees. Also in this article, we consider the use of sparse suffix trees to find the longest symmetric substring.
Authors: A. R. Liss, I. A. Andrianov
Direction: Informatics, management and Computer Technology
Keywords: Sparse suffix trees, similarity search, Ukkonen algorithm
View full article