( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Faster Algorithm for Computing Maximal -gapped Repeats in a String.

, , , , , и . SPIRE, том 9309 из Lecture Notes in Computer Science, стр. 124-136. Springer, (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.

Yuta Toriyama

 

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

Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets., , , , и . MFCS, том 58 из LIPIcs, стр. 38:1-38:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)A Faster Algorithm for Computing Maximal -gapped Repeats in a String., , , , , и . SPIRE, том 9309 из Lecture Notes in Computer Science, стр. 124-136. Springer, (2015)Finding Gapped Palindromes Online., , , , и . IWOCA, том 9843 из Lecture Notes in Computer Science, стр. 191-202. Springer, (2016)Explainable and Local Correction of Classification Models Using Decision Trees., , , , , и . AAAI, стр. 8404-8413. AAAI Press, (2022)Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression., , , , и . SPIRE, том 10508 из Lecture Notes in Computer Science, стр. 304-316. Springer, (2017)Computing Minimal Unique Substrings for a Sliding Window., , , , , и . Algorithmica, 84 (3): 670-693 (2022)Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space., , , , и . IWOCA, том 14764 из Lecture Notes in Computer Science, стр. 327-340. Springer, (2024)Faster STR-IC-LCS Computation via RLE., , , , и . CPM, том 78 из LIPIcs, стр. 20:1-20:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Truncated DAWGs and Their Application to Minimal Absent Word Problem., , и . SPIRE, том 11147 из Lecture Notes in Computer Science, стр. 139-152. Springer, (2018)Rule Mining for Correcting Classification Models., , , , и . ICDM, стр. 1331-1336. IEEE, (2023)