3 citations · 11 across the 16 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.DS2023
Breaking a Barrier in Constructing Compact Indexes for Parameterized Pattern Matching
Kento Iseri, Tomohiro I, Diptarama Hendrian +3
A parameterized string (p-string) is a string over an alphabet , where and are disjoint alphabets for static symbols (s-symbols) and for paramet…
cs.DS2023
Efficient Parameterized Pattern Matching in Sublinear Space
Haruki Ideguchi, Diptarama Hendrian, Ryo Yoshinaka +1
The parameterized matching problem is a variant of string matching, which is to search for all parameterized occurrences of a pattern in a text . In considering matching alg…
cs.DS2023
Linear Time Online Algorithms for Constructing Linear-size Suffix Trie
Diptarama Hendrian, Takuya Takagi, Shunsuke Inenaga +2
The suffix trees are fundamental data structures for various kinds of string processing. The suffix tree of a text string of length has nodes and edges, and the stri…