The parameterized position heap of a trie
From MaRDI portal
Publication:2294053
DOI10.1007/978-3-030-17402-6_20OpenAlexW2929743393MaRDI QIDQ2294053
Yuto Nakashima, Noriki Fujisato, Hideo Bannai, Masayuki Takeda, Shunsuke Inenaga
Publication date: 6 February 2020
Full work available at URL: https://arxiv.org/abs/1903.06289
Related Items (3)
Position heaps for Cartesian-tree matching on strings and tries ⋮ Parameterized DAWGs: efficient constructions and bidirectional pattern searches ⋮ The parameterized suffix tray
This page was built for publication: The parameterized position heap of a trie