String factorisations with maximum or minimum dimension

Autor: Blerina Sinaimeri, Angelo Monti

Publikováno v: Theoretical Computer Science
Theoretical Computer Science, 2020, 842, pp.65-73. ⟨10.1016/j.tcs.2020.07.029⟩
Theoretical Computer Science, Elsevier, 2020, 842, pp.65-73. ⟨10.1016/j.tcs.2020.07.029⟩

In this paper we consider two problems concerning string factorisation. Specifically given a string w and an integer k find a factorisation of w where each factor has length bounded by k and has the minimum (the F-Min-D problem) or the maximum (the F

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bbb10dd858e6a5ae1f443d70dc4ae151
https://inria.hal.science/hal-02955643/file/1912.10140.pdf

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.