Reducing the space requirement of suffix trees

Software - Practice and Experience

Volumn 29, Issue 13, 1999, Pages 1149-1171

  Kurtz, Stefan ^a  

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ADDERS; CODES (SYMBOLS); DATA PROCESSING; DATA STORAGE EQUIPMENT; SET THEORY; STORAGE ALLOCATION (COMPUTER);

SPACE REDUCTION; SPACE REQUIREMENTS; SUFFIX TREE;

DATA STRUCTURES;

EID: 0033227559     PISSN: 00380644     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-024X(199911)29:13<1149::AID-SPE274>3.0.CO;2-O     Document Type: Article

References (38)

1. A. Apostolico, 'The myriad virtues of subword trees', Combinatorial Algorithms on Words, Springer-Verlag, 1985, pp. 85-96.
2. U. Manber and E. W. Myers, 'Sufix arrays: A new method for on-line string searches', SIAM Journal on Computing, 22(5), 935-948 (1993).
3. D. Gusfield, Algorithms on Strings, Trees, and Sequences, Cambridge University Press, New York, 1997.
4. E. M. McCreight, 'A space-economical suffix tree construction algorithm', Journal of the ACM, 23(2), 262-272 (1976).
5. J. Kärkkäinen, 'Suffix cactus: A cross between suffix tree and suffix array', Proc. of the Annual Symposium on Combinatorial Pattern Matching (CPM'95), LNCS 937, 1995, pp. 191-204.
6. M. Crochmore and R. Vérin, 'Direct construction of compact acyclic word graphs', Proc. of the Annual Symposium on Combinatorial Pattern Matching (CPM'97), LNCS 1264, 1997, pp. 116-129.
7. J. Knight, D. Gusfield and J. Stoye, 'The Strmat Software-Package', 1998. http://www.es.ucdavis.edu/∼gusfield/strmat.tar.gz
8. I. Munro, V. Raman and S. Srinivasa Rao, 'Space efficient suffix trees', Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science, Chennai, India, December 1998. Lecture Notes in Computer Science 1530, Springer-Verlag, 1998.
9. A. Andersson and S. Nilsson, 'Efficient implementation of suffix trees', Software - Practice and Experience, 25(2), 129-141 (1995).
10. R. W. Irving, 'Suffix binary search trees', Research Report, Department of Computer Science, University of Glasgow, 1996. http://www.dcs.gla.ac.uk/∼rwi/papers/sbst.ps
11. L. Colussi and A. De Col, 'A time and space efficient data structure for string searching on large texts', Information Processing Letters, 58(5), 217-222 (1996).
12. A. Blumer, J. Blumer, D. Haussler, A. Ehrenfeucht, M. T. Chen and J. Seiferas, 'The smallest automaton recognizing the subwords of a text', Theoretical Computer Science, 40, 31-55 (1985).
13. M. Crochemore, 'Transducers and repetitions', Theoretical Computer Science, 45, 63-86 (1986).
14. A. Blumer, J. Blumer, D. Haussler, R. McConnell and A. Ehrenfeucht, 'Complete inverted files for efficient text retrieval and analysis', Journal of the ACM, 34, 578-595 (1987).
15. C. Lefévre and J.-E. Ikeda, 'The position end-set tree: A small automaton for word recognition in biological sequences', Comp. Appl. Biosci., 9(3), 343-348 (1993).
16. H. W. Mewes and K. Heumann, 'Genome analysis: pattern search in biological macromolecules', Proc. of the Annual Symposium on Combinatorial Pattern Matching (CPM'95), LNCS 937, 1995, pp. 261-285.
17. P. Ferragina and R. Grossi, 'The string B-Tree: a new data structure for string search in external memory and its applications', Journal of the ACM, 46(2), 236-280 (1999).
18. S. Kurtz, 'Reducing the space requirement of suffix trees', Report 98-03, Technische Fakultät, Universität Bielefeld, 1998. http://www.TechFak.Uni-Bielefeld.DE/techfak/∼kurtz/publications.html
19. P. Weiner, 'Linear pattern matching algorithms', Proceedings of the 14th IEEE Annual Symposium on Switching and Automata Theory, The University of Iowa, 1973, pp. 1-11.
20. E. Ukkonen, 'On-line construction of suffix-trees', Algorithmica, 14(3), (1995).
21. M. Farach, 'Optimal suffix tree construction with large alphabets', Proceedings of the 38th Annual Symposium on the Foundations of Computer Science, FOCS 97, IEEE Press, New York, 1997. ftp://cs.rutgers.edu/pub/farach/Suffix.ps.Z
22. R. Giegerich and S. Kurtz, 'From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction', Algorithmica, 19, 331-353 (1997).
23. N. J. Larsson, 'Extended application of suffix trees to data compression', Proceedings of the IEEE Data Compression Conference, IEEE Press, Snowbird, Utah, 1996.
24. A. Blumer, A. Ehrenfeucht and D. Haussler, 'Average size of suffix trees and DAWGS', Discrete Applied Mathematics, 24, 37-45 (1989).
25. R. Giegerich, S. Kurtz and J. Stoye, 'Efficient implementation of lazy suffix trees', Proc. of the Third Workshop on Algorithmic Engineering (WAE99), LNCS 1668, 1999, pp. 33-42.
26. D. E. Knuth, The Art of Computer Programming, Volume 3: Sorting and Searching, Addison-Wesley, Reading, MA, 1973.
27. J. G. Cleary, 'Compact hash tables using bidirectional linear probing', IEEE Trans. on Computers, 33(9), 828-834 (1984).
28. J. J. Darragh, J. G. Cleary and I. H. Witten, 'Bonsai: a compact representation of trees', Software - Practice and Experience, 23(3), 277-291 (1993).
29. J. I. Aoe, K. Morimoto and T. Sato, 'An efficient implementation of trie structures', Software - Practice and Experience, 22(9), 695-721 (1992).
30. K. Morimoto, H. Iriguchi and J. I. Aoe, 'A method of compressing trie structures', Software - Practice and Experience, 24(3), 265-288 (1994).
31. W. I. Chang and E. L. Lawler, 'Sublinear approximate string matching and biological applications', Algorithmica, 12(4/5), 327-344 (1994).
32. S. Kurtz, 'Fundamental Algorithms for a Declarative Pattern Matching System', Dissertation, Technische Fakultät, Universität Bielefeld. (Available as Report 95-03, July 1995.)
33. R. Arnold and T. Bell, 'A corpus for the evaluation of lossless compression algorithms', Proceedings of the Data Compression Conference, 1997, pp. 201-210. http://corpus.canterbury.ac.nz
34. R. Giegerich and S. Kurtz, 'A comparison of imperative and purely functional suffix tree constructions', Science of Computer Programming, 25(2-3), 187-218 (1995).
35. B. Balkenhol, S. Kurtz and Y. M. Shtarkov, 'Modification of the Burrows and Wheeler data compression algorithm', Proceedings of the IEEE Data Compression Conference, IEEE Press, Snowbird, Utah, 1999, pp. 188-197.
36. M. Burrows and D. J. Wheeler, 'A Block-Sorting Lossless Data Compression Algorithm', Research Report 124, Digital Systems Research Center, 1994. http://gatekeeper.dec.com/pub/DEC/SRC/research-reports/abstracts/src-rr-124.html
37. S. Kurtz and C. Schleiermacher, 'REPuter. Fast computation of maximal repeats in complete genomes', Bioinformatics, 15(5), 426-427 (1999).
38. N. J. Larsson, 'The context trees of block sorting compression', Proceedings of the IEEE Data Compression Conference, IEEE Press, Snowbird, Utah, 1998, pp. 189-198.