Dear receiver
I found your implementation of the suffix tree. You point out, that it uses little space. But I could not find any state of time complexity. What is the time complexity of the construction phase of a suffix tree of a given string? Which algorithm was implemented? Thanks a lot for this information. Greetings Judith Zimmermann _______________________________________________ Biojava-l mailing list - [EMAIL PROTECTED] http://biojava.org/mailman/listinfo/biojava-l
