1 |
R. Bayer, C. McCreight, 'Organization and maintenance of large ordered indexes,' Acta Informatica 1, 3. pp. 173-189, 1972
DOI
|
2 |
R. Bayer, K. Unterauer, 'Prefix B-trees,' ACM Trans. Database System 2, 1, pp. 11-26, 1977
DOI
|
3 |
P. Weiner, 'Linear pattern matching algorithms,' Proceedings of the 14th IEEE symposium on Switching and Automata Theory, pp. 1-11, 1973
|
4 |
U. Manber, G. Myers, 'Suffix arrays: a new method for on-line string searches,' SIAM J. Computing 22, pp. 935-948, 1993
DOI
ScienceOn
|
5 |
E. Ukkonen, D. Wood, 'Approximate string matching with suffix automata,' Algorithmica 10, pp. 353-364, 1993
DOI
|
6 |
D. R. Morrison, 'PATRICIA: Practical algorithm to retrieve information coded in alphanumeric,' J. ACM 15, pp. 514-534, 1968
DOI
|
7 |
R. W. Irving, L. Love, 'The suffix binary search tree and suffix AVL tree,' to appear in Journal of Discrete Algorithms
DOI
ScienceOn
|
8 |
D. Gusfield, Algorithms on Strings, Tree, and Sequences, Cambridge University Press, Cambridge, 1997
|
9 |
E. M. McCreight, 'A space-economical suffix tree construction algorithms,' J. ACM 23, pp. 262-272, 1976
DOI
ScienceOn
|
10 |
E. Ukkonen, 'On-line construction of suffix trees,' Algorithmica 14, pp. 353-364, 1993
DOI
|
11 |
D. Comer, 'The ubiquitous B-trees,' Computing Surveys 11, pp. 121-137, 1979
DOI
ScienceOn
|
12 |
P. Ferragina, R. Grossi, 'The string B-tree: a new data structure for string search in external memory and its applications,' JACM 46(2), pp. 236-280, 1999
DOI
ScienceOn
|
13 |
T. Kasai, G. Lee, H. Arimura, S. Arikawa, K. Park, 'Linear-time longest-common-prefix computation in suffix arrays and its applications,' 12th Symposium on Combinatorial Pattern Matching, pp. 181-192, 2001
|
14 |
J S. Vitter, 'External memory algorithms and data structures: dealing with massive data,' ACM Computing Surveys 33, pp. 209-271, 2001
DOI
ScienceOn
|
15 |
N. Prywes, H. Gray, 'The organization of a Multilist-type associative memory ,' IEEE Trans. on Communication and Electronics 68, pp. 488-492, 1963
|