This project explores the development and analysis of an on-line algorithm for constructing suffix trees with linear time complexity. Our study builds upon Ukkonen's foundational work on suffix tree ...
Abstract: The suffix tree is a powerful data structure in string processing and DNA sequence comparisons. However, constructing suffix trees being very greedy in space is a fatal drawback. In addition ...
Abstract: This paper extend Ukkonen's online suffix tree construction algorithm to support substring frequency queries, by adding count fields to the internal nodes of the tree. This has applications ...
1 Department of Cell Therapy and Applied Genomics, King Hussein Cancer Center, Amman, Jordan 2 Department of Pathology and Molecular Medicine, McMaster University, Hamilton, ON, Canada Suffix trees ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results