On-line construction of position heaps

Gregory Kucherov (1)

1 LIGM - Laboratoire d'Informatique Gaspard-Monge

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

Mots clés: String algorithms; Data structures; Text index; Position heap

Domaines: Algorithme et structure de données [cs.DS]; Traitement du texte et du document

Gregory Kucherov. On-line construction of position heaps. Journal of Discrete Algorithms, 2013, 20 (May), pp.3-11. ⟨10.1016/j.jda.2012.08.002⟩. ⟨hal-00790301⟩