[Biojava-dev] UkkonenSuffixTrees methods

[Fernando Alves]

Sorry, I forgot to say that (if possible) I would need to restrain the
search from a point of the reference. For example, if the reference has a
lenght of 100, I would need to search starting from 0, then advancing,
searching from (eg) position 20 forward.

Best

On Tue, Feb 19, 2013 at 2:29 PM, Fernando Alves
<falves at lasige.di.fc.ul.pt>wrote:

> Hi,
>
> I'm currently working on a project and I need to use suffix trees, and I
> have been searching for implementations of Ukkonen trees yours is the one
> that seems to be the one that I need. However I'm having a problem and
> perhaps you could help.
>
> I have a reference String which I use to build a tree. Then, I need to
> search on the tree if other smaller Strings are contained within the
> reference String, given a certain position on the reference and the lenght
> of the match. I already got to a node where the match with a String begins,
> but I'm stuck with getting the lenght of the match.
>
> Could you please help me with this?
>
> Many many thanks in advance
>
> Best,
> Fernando Alves
>