Trie VS Suffix Tree VS Suffix Array

Posted by ukrania on Stack Overflow See other posts from Stack Overflow or by ukrania
Published on 2010-03-21T15:26:09Z Indexed on 2010/03/21 15:31 UTC
Read the original article Hit count: 489

Filed under:
|
|
|

Hello everyone,

Which one is the structure that provides best performance results? Trie, Suffix Tree or Suffix Array? There are other equivalent structures?

What are good Java implementations of these structures?

Thanks for your answers.

Best Regards, ukrania

© Stack Overflow or respective owner

Related posts about java

Related posts about data-structures