论文信息 - On-Line Construction of Position Heaps

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].

Gregory Kucherov

[1] Dan Gusfield,et al. Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .

[2] Peter Weiner,et al. Linear Pattern Matching Algorithms , 1973, SWAT.

[3] Esko Ukkonen,et al. On-line construction of suffix trees , 1995, Algorithmica.

[4] Maxime Crochemore,et al. String Matching with Constraints , 1988, MFCS.

[5] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .

[6] David Haussler,et al. The Smallest Automaton Recognizing the Subwords of a Text , 1985, Theor. Comput. Sci..

[7] Edward Fredkin,et al. Trie memory , 1960, Commun. ACM.

[8] Andrzej Ehrenfeucht,et al. Position heaps: A simple and dynamic text indexing data structure , 2011, J. Discrete Algorithms.

[9] J. Ian Munro,et al. Succinct Representation of Balanced Parentheses and Static Trees , 2002, SIAM J. Comput..

[10] Wojciech Rytter,et al. Text Algorithms , 1994 .

[11] Edward G. Coffman,et al. File structures using hashing functions , 1970, CACM.

[12] Maxime Crochemore,et al. Transducers and Repetitions , 1986, Theor. Comput. Sci..