Overview

position tree


Show Summary Details

Quick Reference

Let

α = a1a2an

denote a string, or word, in the set of all Σ-words, Σ*, and let # be in the alphabet Σ. then the position tree T(α) for α# is a tree whose edges are labeled with elements of

Σ ∪ {#}

and is constructed according to the following rules: (a) T(α) has (n+1) leaves labeled 1, 2,…, n+1 (see diagram);(b) the sequence of labels on the edges of the path from the root to the leaf labeled i is the substring identifier for position i in α#.

(a) T(α) has (n+1) leaves labeled 1, 2,…, n+1 (see diagram);

(b) the sequence of labels on the edges of the path from the root to the leaf labeled i is the substring identifier for position i in α#

Position tree. Tree for 10010 #

Subjects: Computing.


Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.