A Faster Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length von Sakai, Yoshifumi, Inenaga, Shunsuke

Volltext

Sensitivity of string compressors and repetitiveness measures von Akagi, Tooru, Funakoshi, Mitsuru, Inenaga, Shunsuke

Volltext

Computing longest palindromic substring after single-character or block-wise edits von Funakoshi, Mitsuru, Nakashima, Yuto, Inenaga, Shunsuke, Bannai, Hideo, Takeda, Masayuki

Volltext

Dynamic index and LZ factorization in compressed space von Nishimoto, Takaaki, I, Tomohiro, Inenaga, Shunsuke, Bannai, Hideo, Takeda, Masayuki

Volltext

Computing Minimal Unique Substrings for a Sliding Window von Mieno, Takuya, Fujishige, Yuta, Nakashima, Yuto, Inenaga, Shunsuke, Bannai, Hideo, Takeda, Masayuki

Volltext

A hardness result and new algorithm for the longest common palindromic subsequence problem von Inenaga, Shunsuke, Hyyrö, Heikki

Volltext

Combinatorics of minimal absent words for a sliding window von Akagi, Tooru, Kuhara, Yuki, Mieno, Takuya, Nakashima, Yuto, Inenaga, Shunsuke, Bannai, Hideo, Takeda, Masayuki

Volltext

Parameterized DAWGs: Efficient constructions and bidirectional pattern searches von Nakashima, Katsuhito, Fujisato, Noriki, Hendrian, Diptarama, Nakashima, Yuto, Yoshinaka, Ryo, Inenaga, Shunsuke, Bannai, Hideo, Shinohara, Ayumi, Takeda, Masayuki

Volltext

Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts von Takagi, Takuya, Inenaga, Shunsuke, Arimura, Hiroki, Breslauer, Dany, Hendrian, Diptarama

Volltext

Generalized pattern matching and periodicity under substring consistent equivalence relations von Matsuoka, Yoshiaki, Aoki, Takahiro, Inenaga, Shunsuke, Bannai, Hideo, Takeda, Masayuki

Volltext

Palindromic trees for a sliding window and its applications von Mieno, Takuya, Watanabe, Kiichi, Nakashima, Yuto, Inenaga, Shunsuke, Bannai, Hideo, Takeda, Masayuki

Volltext

Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings von Watanabe, Kiichi, Nakashima, Yuto, Inenaga, Shunsuke, Bannai, Hideo, Takeda, Masayuki

Volltext

Efficient computation of longest single-arm-gapped palindromes in a string von Narisada, Shintaro, Hendrian, Diptarama, Narisawa, Kazuyuki, Inenaga, Shunsuke, Shinohara, Ayumi

Volltext

On the size of the smallest alphabet for Lyndon trees von Nakashima, Yuto, Takagi, Takuya, Inenaga, Shunsuke, Bannai, Hideo, Takeda, Masayuki

Volltext

Novel Results on the Number of Runs of the Burrows-Wheeler-Transform von Giuliani, Sara, Inenaga, Shunsuke, Lipták, Zsuzsanna, Prezza, Nicola, Sciortino, Marinella, Toffanello, Anna

Volltext

Linear-size suffix tries and linear-size CDAWGs simplified and improved von Inenaga, Shunsuke

Volltext

Factorizing Strings into Repetitions von Inoue, Hiroe, Matsuoka, Yoshiaki, Nakashima, Yuto, Inenaga, Shunsuke, Bannai, Hideo, Takeda, Masayuki

Volltext

Position Heaps for Cartesian-Tree Matching on Strings and Tries von Nishimoto, Akio, Fujisato, Noriki, Nakashima, Yuto, Inenaga, Shunsuke

Volltext

Space-efficient algorithms for computing minimal/shortest unique substrings von Mieno, Takuya, Köppl, Dominik, Nakashima, Yuto, Inenaga, Shunsuke, Bannai, Hideo, Takeda, Masayuki

Volltext

Faster Lyndon factorization algorithms for SLP and LZ78 compressed text von I, Tomohiro, Nakashima, Yuto, Inenaga, Shunsuke, Bannai, Hideo, Takeda, Masayuki

Volltext