Talk:Suffix tree: Difference between revisions
→definition?
Line 36:
::::: Yes, I misread your example. But then, your example is just like the one I provided earlier: "aa$", only with more "a"s. If you can work out how to find the substring "a$" and "aa$" in that example, extending it to arbitrary length is a no brainer. --[[User:Ledrug|Ledrug]] ([[User talk:Ledrug|talk]]) 01:54, 26 May 2013 (UTC)
:::::: I am not sure I can work that out. Let's take aaa$. The root node can have only one edge leading away from it, which has the label a. I would expect that this node is similar to the tree for 'aa$' but the wikipedia page claims that except for the root node all nodes must have at least two children, and you have stated that only one edge leading from the aa$ node is allowed. I cannot think of any implementation which can satisfy both of these constraints. Perhaps because I am stuck in my thinking about this structure, I also cannot think of any useful algorithms that would use it. --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 05:09, 26 May 2013 (UTC)
| |||