tags:

views:

87

answers:

0
Q: 

best one than suffix trie and KMP automaton

Hii!!

Can anybody help me to know is there any data structure which is having either less time or requires less space than "suffix trie" and KMP automaton.I need it urgently.Please answer my question as soon as possible

related questions

Building a suffix tree for a string matching algorithm in large database.
How to speed up calculation of length of longest common substring?
Successive adding of char to get the longest word in the dictionary
Building a suffix tree in C++
Short, Java implementation of a suffix tree and usage?
Token Suffix Tree Tutorial
Understanding Ukkonen's algorithm for suffix trees
Generalized Suffix Tree Java Implementation
Looking for the suffix tree implementation in C#?