A carregar...
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:
| Publicado no: | Beyond the Horizon of Computability |
|---|---|
| Main Authors: | , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
2020
|
| Assuntos: | |
| Acesso em linha: | 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: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|