Generalized Suffix Tree in Perl

[monkfan]

Dear monks,
Does anybody knows if there exist any Perl implementation for generalized Suffix Tree?
What I can only find so far is Shlomo Yona`s module. Which is very limited and not a generalized one.

Update: Just discoverd there is a new module Tree::Suffix that binds to libstree library,
it takes care of generalized suffix tree.

[Happy-the-monk]

...Shlomo Yona`s module. Which is very limited...

What functionality or generalisation are you particularly missing?

Update:
Except from trying to contact Shlomo and maybe Offer and ask if they are interested or even into that kind of further development, I don't see anything that could help you right now. It seems the module wasn't meant to do what you need.

Update 2:
Further searching CPAN for "Tree" and "Trie" finds a bunch of modules. Maybe there's a more suitable alternative for you there?

Cheers, Sören

[monkfan]

This functionality, which is the essence of generalized suffix tree:


Given a set of multiple strings we would like to construct a single tree out of it.


Where as Yona`s only create one tree for one string.
For a more complete explanation on generalized suffix tree, please kindly refer to the link I gave in my OP.

[tall_man]

The following might be helpful: Re: finding longest common substring

It constructs a suffix tree in order to find the largest common substring of multiple strings.

[Hanamaki]

Or if you want to build your own routines, Rex A. Dwyer gives a gentle introduction on suffix trees in Chapter 12 (esp. pp. 177--193) of Genomic Perl using the word banana and not some DNA or RNA as one might fear.