On-line construction of position heaps

Details On-line construction of position heaps On-line construction of position heaps

2011-04-08

arxiv.org/abs/1104.1601v4

Computer Science

Data Structures and Algorithms

Scientific paper

We propose a simple linear-time on-line algorithm for constructing a position heap for a string [Ehrenfeucht et al, 2011]. Our definition of position heap differs slightly from the one proposed in [Ehrenfeucht et al, 2011] in that it considers the suffixes ordered from left to right. Our construction is based on classic suffix pointers and resembles the Ukkonen's algorithm for suffix trees [Ukkonen, 1995]. Using suffix pointers, the position heap can be extended into the augmented position heap that allows for a linear-time string matching algorithm [Ehrenfeucht et al, 2011].

Affiliated with

Also associated with

No associations

Rating

On-line construction of position heaps does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On-line construction of position heaps, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On-line construction of position heaps will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-355207