Reversed Lempel–Ziv Factorization with Suffix Trees
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...
I tiakina i:
| Kaituhi matua: | |
|---|---|
| Hōputu: | Artigo |
| Reo: | Inglês |
| I whakaputaina: |
MDPI AG
2021-05-01
|
| Rangatū: | Algorithms |
| Ngā marau: | |
| Urunga tuihono: | https://www.mdpi.com/1999-4893/14/6/161 |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|