[Seqan-dev] IndexEsa and longest prefix search (single step of greedy LZW decomposition)

[Sebastian Wandelt <wandelt@informatik.hu-berlin.de>]

Hi,

I would like to use IndexEsa to find the longest infix which is a prefix 
of another (not indexed) string.
This step is part of an algorithm to compute a greedy LZW-decomposition 
of a string with respect to a reference string.

Example:

Given an IndexEsa over AAAACCCCGGGGTTTT, I would like to have the 
longest prefix of CCCGGGAAAT, occurring as an infix in AAAACCCCGGGGTTTT.
The result should be position 5 (and length 6), since the prefix CCCGGG 
can be found at position 5 (0-based string access) and is of length 6.

Is there any ready code for solving this problem in Seqan? I think this 
should be a standard-operation for suffix trees.
I haven't found any code that can be used directly, although I think 
that TopDown-Iterators might be the thing to go for.

Thanks,
Sebastian