Efficient construction of the suffix tree given an input text is an active area of research for the past 40 years. Both theoretical computer scientists and engineers trickled the problem. Unfortunately in the last decade not many results were acknowledged between the two communities. In this paper we narrow this gap by providing formal analysis of the practically fastest to date parallel algorithm for suffix tree construction using the well-accepted Parallel External Memory model of computation.

CY - Koper LA - eng N2 -Efficient construction of the suffix tree given an input text is an active area of research for the past 40 years. Both theoretical computer scientists and engineers trickled the problem. Unfortunately in the last decade not many results were acknowledged between the two communities. In this paper we narrow this gap by providing formal analysis of the practically fastest to date parallel algorithm for suffix tree construction using the well-accepted Parallel External Memory model of computation.

PB - University of Primorska PY - 2013 T2 - MATCOS-13 TI - Theoretical aspects of ERa, the fastest practical suffix tree construction algorithm UR - http://lusy.fri.uni-lj.si/sites/lusy.fri.uni-lj.si/files/publications/jekovec2013-matcos13-paper.pdf ER - The website encountered an unexpected error. Please try again later.