38 citations · 64 across the 26 of their papers we have counts for
21 papers · 1 filter
Subsequence Matching and LCS with Segment Number Constraints
Yuki Yonemoto, Takuya Mieno, Shunsuke Inenaga +2
The longest common subsequence (LCS) is a fundamental problem in string processing which has numerous algorithmic studies, extensions, and applications. A sequence $u_1, \ldots, u_…
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…
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…
Inferring Strings from Position Heaps in Linear Time
Koshiro Kumagai, Diptarama Hendrian, Ryo Yoshinaka +1
Position heaps are index structures of text strings used for the string matching problem. They are rooted trees whose edges and nodes are labeled and numbered, respectively. This p…
Computing the Parameterized Burrows--Wheeler Transform Online
Daiki Hashimoto, Diptarama Hendrian, Dominik Köppl +2
Parameterized strings are a generalization of strings in that their characters are drawn from two different alphabets, where one is considered to be the alphabet of static characte…
Parallel algorithm for pattern matching problems under substring consistent equivalence relations
Davaajav Jargalsaikhan, Diptarama Hendrian, Ryo Yoshinaka +1
Given a text and a pattern over an alphabet, the pattern matching problem searches for all occurrences of the pattern in the text. An equivalence relation is called a sub…