The position heap is a text indexing structure for a single text string, recently proposed by Ehrenfeucht et al. [Position heaps: A simple and dynamic text indexing data structure, Journal of Discrete Algorithms, 9(1):100-121, 2011]. In this paper we introduce the position heap for a set of strings, and propose an efficient algorithm to construct the position heap for a set of strings which is given as a trie. For a fixed alphabet our algorithm runs in time linear in the size of the trie. We also show that the position heap can be efficiently updated after addition/removal of a leaf of the input trie. © 2012 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Nakashima, Y., I, T., Inenaga, S., Bannai, H., & Takeda, M. (2012). The position heap of a trie. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7608 LNCS, pp. 360–371). Springer Verlag. https://doi.org/10.1007/978-3-642-34109-0_38
Mendeley helps you to discover research relevant for your work.