MathGroup Archive 2009

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: Ukkonen's Suffix Tree Algorithm in Mathematica

  • To: mathgroup at smc.vnet.net
  • Subject: [mg103110] Re: Ukkonen's Suffix Tree Algorithm in Mathematica
  • From: Szabolcs Horvát <szhorvat at gmail.com>
  • Date: Tue, 8 Sep 2009 05:58:38 -0400 (EDT)
  • References: <h829i3$3q0$1@smc.vnet.net>

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/


  • Prev by Date: Re: How does Eigensystem works ?
  • Next by Date: Re: An arithmetic puzzle, equality of numbers.
  • Previous by thread: Re: Ukkonen's Suffix Tree Algorithm in Mathematica
  • Next by thread: Re: Ukkonen's Suffix Tree Algorithm in Mathematica