2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.DS2020★ 2 cited
Parameterized DAWGs: efficient constructions and bidirectional pattern searches
Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian +6
Two strings and over of equal length are said to \emph{parameterized match} (\emph{p-match}) if there is a renaming bijection that…
cs.DS2019
An Extension of Linear-size Suffix Tries for Parameterized Strings
Katsuhito Nakashima, Diptarama Hendrian, Ryo Yoshinaka +1
In this paper, we propose a new indexing structure for parameterized strings which we call PLSTs, by generalizing linear-size suffix tries for ordinary strings. Two parameterized s…