|
Volumn 1741, Issue , 1999, Pages 225-236
|
Constructing the suffix tree of a tree with a large alphabet
|
Author keywords
[No Author keywords available]
|
Indexed keywords
CLUSTERING ALGORITHMS;
PATTERN MATCHING;
BEST-KNOWN ALGORITHMS;
COMMON SUFFIX TREE;
INTEGER ALPHABETS;
LARGE ALPHABETS;
LINEAR-TIME ALGORITHMS;
SEQUENTIAL TRANSDUCERS;
TIME ALGORITHMS;
TREE-PATTERN MATCHING;
ALGORITHMS;
|
EID: 84958051164
PISSN: 03029743
EISSN: 16113349
Source Type: Book Series
DOI: 10.1007/3-540-46632-0_24 Document Type: Conference Paper |
Times cited : (19)
|
References (13)
|