*This preview shows
page 1. Sign up
to
view the full content.*

**Unformatted text preview: **for adding the labels back. The leaves are labeled. There is an algorithm that runs in linear time for any alphabet. 3. Let s ( v ) be the string of a node v , which is the concatenation of all the strings from the root of a sux tree to the node. Show that for every node v of a sux tree, if s ( v ) = aB , a ,B * , there is a node u such that s ( u ) = B . Note that this relationship denes a function sl ( v ) = u , which is called the sux link of v . Give an algorithm for computing sl () for every node. Note that there is a linear time algorithm that nds all sux links for any alphabet....

View
Full
Document