Sign Up to like & get
recommendations!
0
Published in 2021 at "Algorithms"
DOI: 10.3390/a14060161
Abstract: 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-overlapping reverse…
read more here.
Keywords:
reversed lempel;
lempel ziv;
ziv factorization;
factorization suffix ... See more keywords