suffix tree: learning notes #no insight yet

for haystack length = N,

  • each root-to-leaf path maps to a unique suffix, if you

    concatenate the edge labels

  • exactly N leaf nodes numbered 1 to N

Not a binary tree construction is less straightforward than suffix array

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s