3 citations · 5 across the 6 of their papers we have counts for
6 papers
Position Heaps for Cartesian-tree Matching on Strings and Tries
Akio Nishimoto, Noriki Fujisato, Yuto Nakashima +1
The Cartesian-tree pattern matching is a recently introduced scheme of pattern matching that detects fragments in a sequential data stream which have a similar structure as a query…
The Parameterized Suffix Tray
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga +2
Let and be disjoint alphabets, respectively called the static alphabet and the parameterized alphabet. Two strings and over of equal length are said to pa…
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…
Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga +2
We present the first worst-case linear time algorithm that directly computes the parameterized suffix and LCP arrays for constant sized alphabets. Previous algorithms either requir…
The Parameterized Position Heap of a Trie
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga +2
Let and be disjoint alphabets of respective size and . Two strings over of equal length are said to parameterized match (p-match) if there is a bijection $…
Right-to-left online construction of parameterized position heaps
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga +2
Two strings of equal length are said to parameterized match if there is a bijection that maps the characters of one string to those of the other string, so that two strings become…