@inproceedings{f6a33cd8f34c4f9a83332f604e1772c7,

title = "The Parameterized Position Heap of a Trie",

abstract = "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.",

author = "Noriki Fujisato and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda",

year = "2019",

month = jan,

day = "1",

doi = "10.1007/978-3-030-17402-6_20",

language = "English",

isbn = "9783030174019",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "237--248",

editor = "Pinar Heggernes",

booktitle = "Algorithms and Complexity - 11th International Conference, CIAC 2019, Proceedings",

address = "Germany",

note = "11th International Conference on Algorithms and Complexity, CIAC 2019 ; Conference date: 27-05-2019 Through 29-05-2019",

}