[Biojava-l] SuffixTree

Zimmermann, Judith judithz@student.ethz.ch
Mon, 9 Dec 2002 09:38:00 +0100


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