( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Computing Abelian regularities on RLE strings.

, , , , и . CoRR, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Genichiro Takeda

Masayuki Hirosue

Michiko Takeda

Kijuro Takeda

Takehisa Takeda

 

Другие публикации лиц с тем же именем

Time and Space Efficient Lempel-Ziv Factorization based on Run Length Encoding, , , и . CoRR, (2012)A new characterization of maximal repetitions by Lyndon trees., , , , , и . CoRR, (2014)Computing Abelian regularities on RLE strings., , , , и . CoRR, (2017)A comparison study between genetic algorithms and bayesian optimize algorithms by novel indices., , и . GECCO, стр. 1485-1492. ACM, (2005)Inferring Strings from Lyndon Factorization., , , , , и . MFCS (2), том 8635 из Lecture Notes in Computer Science, стр. 565-576. Springer, (2014)Faster STR-IC-LCS Computation via RLE., , , , и . CPM, том 78 из LIPIcs, стр. 20:1-20:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations., , , , и . CPM, том 128 из LIPIcs, стр. 29:1-29:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Factorizing a String into Squares in Linear Time., , , , и . CPM, том 54 из LIPIcs, стр. 27:1-27:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings., , , , и . ISAAC, том 92 из LIPIcs, стр. 33:1-33:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Compressed Pattern Matching.. Encyclopedia of Algorithms, Springer, (2008)