Loading...
Faster Online Computation of the Succinct Longest Previous Factor Array
We consider the problem of computing online the Longest Previous Factor array LPF[1, n] of a text T of length n. For each [Formula: see text], LPF[i] stores the length of the longest factor of T with at least two occurrences, one ending at i and the other at a previous position [Formula: see text]....
Na minha lista:
| Udgivet i: | Beyond the Horizon of Computability |
|---|---|
| Main Authors: | , |
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
2020
|
| Fag: | |
| Online adgang: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7309487/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-51466-2_31 |
| Tags: |
Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
|