Photo from academic.microsoft.com
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… Click to show full 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 factor table [Crochemore et al., JDA’12] within the same space but pay a multiplicative logarithmic time penalty.
Keywords:
reversed lempel;
lempel ziv;
ziv factorization;
factorization suffix
Journal Title: Algorithms
Year Published: 2021
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Algorithms
Year Published: 2021
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!