++ Wow, thank you for introducing me to suffix trees. What an interesting concept, and how refreshing to see a linear-time algorithm for constructing such a creature.
I see you've used the javascript applet at this page, which others may want to check out.
However, I'd like to slightly revise the algorithm you outlined. Consider the following example:
string = ababc%bc$
| |(3:abc%bc$)|leaf
|(1:ab)|
| |(5:c%bc$)|leaf
tree:|
| |(3:abc%bc$)|leaf
|(2:b)|
| | |(6:%bc$)|leaf
| |(5:c)|
| | |(9:$)|leaf
|
| |(6:%bc$)|leaf
|(5:c)|
| |(9:$)|leaf
|
|(6:%bc$)|leaf
|
|(9:$)|leaf
"ab" appears twice in the first string, and so it gives a node with two leaves. The actual condition you should check is whether a node has one leaf containing the % separator and another leaf without the % symbol.
-
Are you posting in the right place? Check out Where do I post X? to know for sure.
-
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
<u> <ul>
-
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
intervention).
-
Want more info? How to link
or How to display code and escape characters
are good places to start.
|