Database
aa896.asc
Associated article: Algorithm Alley: Fast String Searching with Suffix Trees
Tags: Database
_Algorithm Alley_
by Mark R. Nelson
Example 1:
Update( new_suffix )
{
current_suffix = active_point
test_char = last_char in new_suffix
done = false;
while ( !done ) {
if current_suffix ends at an explicit node {
if the node has no descendant edge ...


