| No. |
Title |
Author |
Year |
| 1 |
{RePair} Grammars Are the Smallest Grammars for Fibonacci Words |
Mieno, Takuya et al. |
2022 |
| 2 |
Cartesian Tree Subsequence Matching |
Oizumi, Tsubasa et al. |
2022 |
| 3 |
Computing Palindromes on a Trie in Linear Time |
Mieno, Takuya et al. |
2022 |
| 4 |
Minimal Absent Words on Run-Length Encoded Strings |
Akagi, Tooru et al. |
2022 |
| 5 |
A Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length |
Sakai, Yoshifumi et al. |
2020 |
| 6 |
DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures |
Nakashima, Katsuhito et al. |
2020 |
| 7 |
Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences |
Funakoshi, Mitsuru et al. |
2020 |
| 8 |
An Improved Data Structure for Left-Right Maximal Generic Words Problem |
Fujishige, Yuta et al. |
2019 |
| 9 |
Computing Runs on a Trie |
Sugahara, Ryo et al. |
2019 |
| 10 |
Faster Queries for Longest Substring Palindrome After Block Edit |
Funakoshi, Mitsuru et al. |
2019 |
| 11 |
On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations |
Urabe, Yuki et al. |
2019 |
| 12 |
Online Algorithms for Constructing Linear-Size Suffix Trie |
Hendrian, Diptarama et al. |
2019 |
| 13 |
Computing longest common square subsequences |
Inoue, Takafumi et al. |
2018 |
| 14 |
Faster Online Elastic Degenerate String Matching |
Aoyama, Kotaro et al. |
2018 |
| 15 |
Longest Lyndon Substring After Edit |
Urabe, Yuki et al. |
2018 |
| 16 |
Longest substring palindrome after edit |
Funakoshi, Mitsuru et al. |
2018 |
| 17 |
Lyndon Factorization of Grammar Compressed Texts Revisited |
Furuya, Isamu et al. |
2018 |
| 18 |
Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings |
Fujishige, Yuta et al. |
2017 |
| 19 |
Computing All Distinct Squares in Linear Time for Integer Alphabets |
Bannai, Hideo et al. |
2017 |
| 20 |
Faster STR-IC-LCS Computation via RLE |
Kuboi, Keita et al. |
2017 |
| 21 |
Small-Space LCE Data Structure with Constant-Time Queries |
Tanimura, Yuka et al. |
2017 |
| 22 |
Tight Bounds on the Maximum Number of Shortest Unique Substrings |
Mieno, Takuya et al. |
2017 |
| 23 |
Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets |
Fujishige, Yuta et al. |
2016 |
| 24 |
Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction |
Tanimura, Yuka et al. |
2016 |
| 25 |
Efficiently Finding All Maximal alpha-gapped Repeats |
Gawrychowski, Pawel et al. |
2016 |
| 26 |
Factorizing a String into Squares in Linear Time |
Matsuoka, Yoshiaki et al. |
2016 |
| 27 |
Fully Dynamic Data Structure for LCE Queries in Compressed Space |
Nishimoto, Takaaki et al. |
2016 |
| 28 |
Fully-online Construction of Suffix Trees for Multiple Texts |
Takagi, Takuya et al. |
2016 |
| 29 |
Shortest Unique Substring Queries on Run-Length Encoded Strings |
Mieno, Takuya et al. |
2016 |
| 30 |
Faster Compact On-Line Lempel-Ziv Factorization |
Yamamoto, Jun'ichi et al. |
2014 |
| 31 |
An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Program |
Matsubara, Wataru et al. |
2008 |
