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 such that (1) f is identity on and (2) f maps the characters of one string to those of the other string so that the two strings become identical. We consider the p-matching problem on a (reversed) trie and a string pattern P such that every path that p-matches P has to be reported. Let N be the size of the given trie. In this paper, we propose the parameterized position heap for that occupies O(N) space and supports p-matching queries in time, where m is the length of a query pattern P and is the number of paths in to report. We also present an algorithm which constructs the parameterized position heap for a given trie in time and working space.
CITATION STYLE
Fujisato, N., Nakashima, Y., Inenaga, S., Bannai, H., & Takeda, M. (2019). The Parameterized Position Heap of a Trie. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11485 LNCS, pp. 237–248). Springer Verlag. https://doi.org/10.1007/978-3-030-17402-6_20
Mendeley helps you to discover research relevant for your work.