Linear pattern matching on sparse suffix trees

Details Linear pattern matching on sparse suffix trees Linear pattern matching on sparse suffix trees

2011-03-14

arxiv.org/abs/1103.2613v1

Computer Science

Data Structures and Algorithms

Scientific paper

10.1109/CCP.2011.45

Packing several characters into one computer word is a simple and natural way to compress the representation of a string and to speed up its processing. Exploiting this idea, we propose an index for a packed string, based on a {\em sparse suffix tree} \cite{KU-96} with appropriately defined suffix links. Assuming, under the standard unit-cost RAM model, that a word can store up to $\log_{\sigma}n$ characters ($\sigma$ the alphabet size), our index takes $O(n/\log_{\sigma}n)$ space, i.e. the same space as the packed string itself. The resulting pattern matching algorithm runs in time $O(m+r^2+r\cdot occ)$, where $m$ is the length of the pattern, $r$ is the actual number of characters stored in a word and $occ$ is the number of pattern occurrences.

Affiliated with

Also associated with

No associations

Rating

Linear pattern matching on sparse suffix trees 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 Linear pattern matching on sparse suffix trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear pattern matching on sparse suffix trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-259162