On-Line Construction of Position Heaps
We propose a simple linear-time on-line algorithm for constructing a position heap for a string [EMOW11]. Our definition of position heap differs slightly from the one proposed in [EMOW11] in that it considers the suffixes ordered in the descending order of length. Our construction is based on classic suffix pointers and resembles the Ukkonen’s algorithm for suffix trees [Ukk95]. Using suffix pointers, the position heap can be extended into the augmented position heap that allows for a linear-time string matching algorithm [EMOW11].
Unable to display preview. Download preview PDF.
- [EMOW11]Ehrenfeucht, A., McConnell, R., Osheim, N., Woo, S.-W.: Position heaps: A simple and dynamic text indexing data structure. CPM 2009 Lille 9(1), 100–121 (2011); Preliminary version in Proc. 20th Anniversary Edition of the Annual Symposium on Combinatorial Pattern Matching (CPM 2009)MathSciNetCrossRefMATHGoogle Scholar
- [Wei73]Weiner, P.: Linear pattern matching algorithm. In: 14th Annual IEEE Symposium on Switching and Automata Theory, pp. 1–11 (1973)Google Scholar