[Seqan-dev] Suffix links

[John Reid <j.reid@mail.cryst.bbk.ac.uk>]

Hi,

I had a little google for this but I didn't find the answer. I have an
algorithm which should run quickly on a suffix tree or array. However in
the algorithm I will need to move from a node for say the suffix GCCGAA
to the node for CCGAA. This is obviously expensive in a normal suffix
tree. However I think that some suffix tree construction algorithms
create suffix links (perhaps Ukkonen's algorithm) that do exactly this.
Does SeqAn contain such algorithms and how can I access the suffix links
after construction?

Thanks,
John.