On-line construction of compact suffix vectors and maximal repeats

Élise Prieur, Thierry Lecroq
2008 Theoretical Computer Science  
They proposed a linear construction algorithm of an extended suffix vector, then another linear algorithm to transform an extended suffix vector into a more space-economical compact suffix vector. We propose an on-line linear algorithm for directly constructing a compact suffix vector. Not only do we show that it is possible to directly build a compact suffix vector but we will also show that this on-line construction can be faster than the construction of the extended suffix vector. Then we
more » ... malize the relation between suffix vectors and compact suffix automata which leads to an efficient method for computing maximal repeats using suffix vectors.
doi:10.1016/j.tcs.2008.06.017 fatcat:f64iacdfvngffmais4ta5vpb3y