Talk:Suffix tree: Difference between revisions
→definition?
m (→definition?) |
|||
Line 40:
:::::: Actually, that banana$ example - enumerating the edges there, combined with a re-read of the definition and realizing that it's not making any O(1) guarantees at the nodes -- I now think that the suffix tree representation of 'aaaaaaa$' winds up enumerating all the edges which start with 'a' at a single node -- helps quite a lot. Thank you. --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 14:08, 26 May 2013 (UTC)
== definition (take 2) ==
I am still dissatisfied with the definition of suffix trees. This page refers to wikipedia and the wikipedia page's definition is quoted above.
My current dissatisfaction is that I see no reason, based on the wikipedia definition, to exclude an implementation, for banana, which looks like this:
b-> 'banana$'
a-> 'anana$', 'ana$', 'a$'
n-> 'nana$', 'na$'
$-> '$'
But, of course, this differs from the required result for this task. I can probably extract the definition from the example, given enough thought (and perhaps some or all of the implementations suggested on the wikipedia page can be made to match this example), but I would prefer a real definition for this task.
(A perhaps related issue is that the required result suggests that this structure is not a "tree" but a "directed acyclic graph").
Anyways, can someone supply the missing part of the definition? --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 14:43, 26 May 2013 (UTC)
| |||