From: Scott on
I've ported a C implementation of Ukkonen's algorithm for suffix trees
to Mathematica. I'm happy to send it along to anyone interested.

Cheers, Scott

From: meitnik on
Scott, I would be interested in a copy of the code. Thank you.

From: Szabolcs Horvát on
On 2009.09.07. 8:34, Scott wrote:
> I've ported a C implementation of Ukkonen's algorithm for suffix trees
> to Mathematica. I'm happy to send it along to anyone interested.
>

Why don't you make it available on a webpage? Or, if you don't have the
possibility to do that, submit to MathSource?
http://library.wolfram.com/contribute/

From: ScottG on
On Sep 8, 5:57 am, Szabolcs Horv=E1t <szhor...(a)gmail.com> wrote:
> On 2009.09.07. 8:34, Scott wrote:
>
> > I've ported a C implementation of Ukkonen's algorithm forsuffixtrees
> > to Mathematica. I'm happy to send it along to anyone interested.
>
> Why don't you make it available on a webpage? Or, if you don't have th=
e
> possibility to do that, submit to MathSource?http://library.wolfram.com/c=
ontribute/

Code submitted to MathSource.

Thanks for the suggestion.

Cheers, Scott