Suffix trees on words

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

Volumn 1075, Issue , 1996, Pages 102-115

  Andersson, Arne ^a   Jesper Larsson, N ^a   Swanson, Kurt ^a  

^a LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN MATCHING;

ADDITIONAL COSTS; CONSTRUCTION COSTS; EXPECTED RUNNING TIME; INPUT STRING; NATURAL PARTITIONING; NODE ORDERING; SUBLINEAR TIME; SUFFIX-TREES;

FORESTRY;

EID: 78249254499     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61258-0_9     Document Type: Conference Paper

References (14)

1. A. Andersson and S. Nilsson. Improved behaviour of tries by adaptive branching. Inf. Process. Lett., 46:295-300, 1993.
2. A. Andersson and S. Nilsson. Faster searching in tries and quadtrees—an analysis of level compression. In Proc. 2nd Annual European Symposium on Algorithms, pages 82-93. Springer Verlag, 1994.
3. A. Andersson and S. Nilsson. Efficient implementation of suffix trees. Software— Practice and Experience, 25(2):129-141, 1995.
4. A. Apostolico. The myriad virtues of subword trees. In A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words, NATO ISI Series, pages 85-96. Springer-Verlag, 1985.
5. R. Baeza-Yates and G. H. Gonnet. Efficient text searching of regular expressions. In Proceedings of the 16th International Colloquium on Automata, Languages and Programming (ICALP’89), volume 372 of Lecture Notes in Computer Science, pages 46-62. Springer-Verlag, 1989.
6. M. Dietzfelbinger, A. Karlin, K. Mehlhom, F. Meyer auf der Heide, H. Rohnert, and R. E. Tarjan. Dynamic perfect hashing: Upper and lower bounds. SIAM Journal on Computing, 23:738-761, 1994.
7. M. L. Fredman and D. E. Willard. Surpassing the information theoretic bound with fusion trees. Journal of Computer and System Sciences, 47:424-436, 1993.
8. R. Giegerich and S. Kurtz. Suffix trees in the functional programming paradigm. In European Symposium on Programming (ESOP ’94), volume 788 of Lecture Notes in Computer Science, pages 225-240. Springer-Verlag, 1994.
9. G. H. Gonnet and R. Baeza-Yates. Handbook of Algorithms and Data Structures. Addison-Wesley, 1991. ISBN 0-201-41607-7.
10. D. Harel and R. E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal of Computing, 13:338-355, 1984.
11. U. Manber and G. Myers. Suffix arrays: a new method for on-line string searches. SIAM J. Comput., 22(5):935-948, Oct. 1993.
12. E. M. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23:262-272, 1976.
13. E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14(3):249-260, Sept. 1995.
14. P. Weiner. Linear pattern matching algorithms. In Proceedings 14th IEEE Symposium on Foundations of Computer Science (FOCS), pages 1-11, 1973.