|
|
|
|
|
Dominik Köppl
We present linear-time algorithms computing the reversed Lempel?Ziv factorization [Kolpakov and Kucherov, TCS?09] within the space bounds of two different suffix tree representations. We can adapt these algorithms to compute the longest previous non-over...
ver más
|
|
|
|
|