On-Line Construction of Position Heaps - CNRS - Centre national de la recherche scientifique Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

On-Line Construction of Position Heaps

Résumé

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].
Fichier principal
Vignette du fichier
paper.pdf (145.63 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00681855 , version 1 (22-03-2012)

Identifiants

Citer

Gregory Kucherov. On-Line Construction of Position Heaps. 18th International Symposium on String Processing and Information Retrieval (SPIRE 2011), Oct 2011, Pisa, Italy. pp.326-337, ⟨10.1007/978-3-642-24583-1_32⟩. ⟨hal-00681855⟩
67 Consultations
182 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More