Revision as of 16:37, 23 May 2013 (view source) Rdm (talk \| contribs) (→‎definition?) ← Older edit		Revision as of 13:02, 24 May 2013 (view source) rosettacode>Ledrug (→‎definition?) Newer edit →
Line 27: What is the missing part of this definition? --[[User:Rdm\|Rdm]] ([[User talk:Rdm\|talk]]) 16:33, 23 May 2013 (UTC) : On every node, each edge leading away from it must start with a unique letter. So the suffix tree of string "aa$" can't have two edges "a$" and "aa$" leading away from the root node. Instead it must have one edge "a" pointing to a second node, which in turn has two outgoing edges "a$" and "$". The reason for unique leading letters is that, otherwise when matching substrings, one can't decide which edge to follow at each node in O(1) time. --[[User:Ledrug\|Ledrug]] ([[User talk:Ledrug\|talk]]) 13:02, 24 May 2013 (UTC)

Talk:Suffix tree: Difference between revisions

Talk:Suffix tree (view source)