Sparse suffix trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1090, Issue , 1996, Pages 219-230

  Kärkkäinen, Juha ^a   Ukkonen, Esko ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS;

AVERAGE CASE; RUN-TIME ANALYSIS; SEARCH ALGORITHMS; SUFFIX-TREES;

FORESTRY;

EID: 84948971495     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61332-3_155     Document Type: Conference Paper

References (16)

1. A. Andersson, N. J. Larsson, and K. Swansson, Suffix trees on words, in Proc. 7th Symposium on Combinatorial Pattern Matching (CPM), 1996. To appear.
2. A. Andersson and S. Nilsson, Improved behaviour of tries by adaptive branching, Inf. Process. Lett., 46 (1993), pp. 295-300.
3. A. Andersson and S. Nilsson, Efficient implementation of suffix trees, Software-Practice and Experience, 25 (1995), pp. 129-141.
4. A. APOSTOLICO, The myriad virtues of subword trees, in Combinatorial Algorithms on Words, A. Apostolico and Z. Galil, eds., Springer-Verlag, 1985, pp. 85-95.
5. A. Apostolico and W. Szpankowski, Self-alignments in words and their applications, Journal of Algorithms, 13 (1992), pp. 446-467.
6. G. H. Gonnet, R. A. Baeza-Yates, and T. Snider, Lexicographical indices for text: Inverted files vs. PAT trees, Technical Report OED-91-01, Centre for the New OED, University of Waterloo, 1991.
7. R. W. IRVING, Suffix binary search trees, Technical report TR-1995-7, Computing Science Department, University of Glasgow, Apr. 1995.
8. J. KarkkÄinen, Suffix cactus: A cross between suffix tree and suffix array, in Proc. 6th Symposium on Combinatorial Pattern Matching, CPM 95, 1995, pp. 191-204.
9. D. E. Knuth, J. H. Morris, and V. R. Pratt, Fast pattern matching in strings, SIAM J. Comput., 6 (1977), pp. 323-350.
10. S. R. KOSARAJU AND A. L. Delcher, Large-scale assembly of DNA strings and space-efficient construction of suffix trees, in Proc. 27th Annual ACM Symposium on Theory of Computing (STOC), 1995, pp. 169-177.
11. U. Manber and G. Myers, Suffix arrays: A new method for on-line string searches, SIAM J. Comput., 22 (1993), pp. 935-948.
12. U. Manber and S. Wu, A two-level approach to information retrieval, Technical Report TR 93-06, University of Arizona, 1993.
13. E. M. McCreight, A space-economical suffix tree construction algorithm, J. Assoc. Comput. Mach., 23 (1976), pp. 262-272.
14. D. R. Morrison, PATRICIA-Practical Algorithm To Retrieve Information Coded in Alphanumeric, J. Assoc. Comput. Mach., 15 (1968), pp. 514-534.
15. E. UKKONEN, On-line construction of suffix-trees, Algorithmica, 14 (1995), pp. 249-260.
16. P. Weiner, Linear pattern matching algorithms, in Proc. IEEE 14th Annual Symposium on Switching and Automata Theory, 1973, pp. 1-11.