The Position Heap of a Trie

@inproceedings{Nakashima2012ThePH,
  title={The Position Heap of a Trie},
  author={Yuto Nakashima and I Tomohiro and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda},
  booktitle={SPIRE},
  year={2012}
}
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… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Similar Papers

Loading similar papers…