Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Tyczyński, Wojciech"'
Autor:
Crochemore, Maxime, Iliopoulos, Costas, Kociumaka, Tomasz, Kubica, Marcin, Pachocki, Jakub, Radoszewski, Jakub, Rytter, Wojciech, Tyczyński, Wojciech, Waleń, Tomasz
We derive a simple efficient algorithm for Abelian periods knowing all Abelian squares in a string. An efficient algorithm for the latter problem was given by Cummings and Smyth in 1997. By the way we show an alternative algorithm for Abelian squares
Externí odkaz:
http://arxiv.org/abs/1208.3313
Autor:
Flouri, Tomáš, Iliopoulos, Costas S., Kociumaka, Tomasz, Pissis, Solon P., Puglisi, Simon J., Smyth, W.F., Tyczyński, Wojciech
Publikováno v:
In Theoretical Computer Science 30 September 2013 506:102-114
Autor:
Crochemore, Maxime, Iliopoulos, Costas S., Kociumaka, Tomasz, Kubica, Marcin, Radoszewski, Jakub, Rytter, Wojciech, Tyczyński, Wojciech, Waleń, Tomasz
Publikováno v:
Combinatorial Pattern Matching (9783642312649); 2012, p27-40, 14p