( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A new characterization of maximal repetitions by Lyndon trees.

, , , , , и . SODA, стр. 562-571. SIAM, (2015)

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.

Shunsuke Saito

 

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

Bidirectional Construction of Suffix Trees.. Stringology, стр. 75-87. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, (2002)On-line construction of compact directed acyclic word graphs., , , , , , и . Discret. Appl. Math., 146 (2): 156-179 (2005)Computing Abelian regularities on RLE strings., , , , и . CoRR, (2017)Novel Results on the Number of Runs of the Burrows-Wheeler-Transform., , , , , и . SOFSEM, том 12607 из Lecture Notes in Computer Science, стр. 249-262. Springer, (2021)Dynamic Edit Distance Table under a General Weighted Cost Function., , и . SOFSEM, том 5901 из Lecture Notes in Computer Science, стр. 515-527. Springer, (2010)Ternary Directed Acyclic Word Graphs., , , и . CIAA, том 2759 из Lecture Notes in Computer Science, стр. 120-130. Springer, (2003)Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing., , , и . IWOCA, том 9843 из Lecture Notes in Computer Science, стр. 213-225. Springer, (2016)Towards Modeling Stored-value Electronic Money Systems., , и . NaBIC, стр. 902-907. IEEE, (2009)Suffix Trees, DAWGs and CDAWGs for Forward and Backward Tries.. CoRR, (2019)Faster STR-IC-LCS Computation via RLE., , , , и . CPM, том 78 из LIPIcs, стр. 20:1-20:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)