Efficiency problem

[bukosabino]

Hi @ptrus ,

Very good python package. Congratulations!

I have the next problem:

I need to use Generalized Suffix Trees (k-lcs problem) with 2000 inputs and very big strings. I can work without problem with 5 or 10 rows, but with 2000 is impossible. What do you recommend me?

Regards,

[yoshihikoueno]

If it's that big, isn't it better to use C/C++?

[Zhylkaaa]

Can you try using #19 pull request, maybe this will help. Tell if it's worked for you