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 H. Bannai and M. Takeda},
  booktitle={SPIRE},
  year={2012}
}
  • Yuto Nakashima, I. Tomohiro, +2 authors M. Takeda
  • Published in SPIRE 2012
  • Computer Science
  • 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

    Figures and Topics from this paper.

    Position Heaps for Parameterized Strings
    7
    On-line construction of position heaps
    11
    New Algorithms for Position Heaps
    9
    Constructing LZ78 tries and position heaps in linear time for large alphabets
    8
    Linear-size suffix tries
    7
    Right-to-left online construction of parameterized position heaps
    5
    Suffix Trees, DAWGs and CDAWGs for Forward and Backward Tries
    2
    Combinatorial Pattern Matching
    1
    The Parameterized Position Heap of a Trie
    1

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 20 REFERENCES
    On-line construction of position heaps
    11
    Position heaps: A simple and dynamic text indexing data structure
    27
    Suffix arrays: a new method for on-line string searches
    2152
    Constructing the Suffix Tree of a Tree with a Large Alphabet
    37
    Maintaining information in fully dynamic trees with top trees
    117
    Efficient tree pattern matching
    85
    Linear Pattern Matching Algorithms
    1707