J
Joseph
Hi all,
I want to build a compressed suffix trie from a string for string
matching.instead of doing like:
input:a string with 10 chars
insert char array 10
insert char array 9,10
insert char array 8,9,10
....
insert char array 1,2,3,4,5,6,7,8,9,10
is there any efficient way to build a trie?
the above method is toooo slow and consum much memory!
Thanks a lot guys
I want to build a compressed suffix trie from a string for string
matching.instead of doing like:
input:a string with 10 chars
insert char array 10
insert char array 9,10
insert char array 8,9,10
....
insert char array 1,2,3,4,5,6,7,8,9,10
is there any efficient way to build a trie?
the above method is toooo slow and consum much memory!
Thanks a lot guys