On-line construction of two-dimensional suffix trees

Journal of Complexity

Volumn 15, Issue 1, 1999, Pages 72-127

  Giancarlo, Raffaele ^a   Guaiana, Daniela ^a  

^a UNIVERSITY OF PALERMO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346614684     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcom.1998.0495     Document Type: Article

References (41)

1. Aho A. V., Hopcroft J. E., Ullman J. D. The Design and Analysis of Computer Algorithms. 1974;Addison-Wesley, Reading.
2. Amir A., Farach M. Two-dimensional dictionary matching. Inform. Process. Lett. 44:1992;233-239.
3. Amir A., Farach M., Idury R., La Poutre J., Schaffer A. Improved dynamic dictionary matching. Inform. and Comput. 119:1995;258-282.
4. Apostolico A. The myriad virtues of subword trees. Combinatorial Algorithms on words. NATO ASI Series F. 12:1984;Springer-Verlag, Berlin. p. 85-96.
5. A. Apostolico, C. Iliopoulos, G. Landau, B. Schieber, U. Vishkin, 1988, Parallel construction of a suffix tree with applications, Algorithmica, 3, 1988, 347, 365.
6. Chang W. I., Lawler E. L. Approximate string matching in sublinear expected time. Proc. 31st Symposium on Foundations of Computer Science. IEEE. 1990;. p. 116-124.
7. Chen M. T., Seiferas J. Efficient and elegant subword-tree construction. Apostolico A., Galil Z. Combinatorial Algorithms on Words. NATO ASI Series F. 12:1984;97-107 Springer-Verlag, Berlin.
8. Choi Y., Lam T. W. Two-dimensional pattern matching on a dynamic library of texts. Du D. Z., Li M. COCOON, 1995. Lecture Notes in Comput. Sci. 1995;530-538 Springer-Verlag, New York/Berlin.
9. Farach M. Optimal suffix tree construction with large alphabets. Proc. 38th Symposium on Foundations of Computer Science. IEEE. 1997;. p. 134-146.
10. Farach M., Mathukrishnan S. Optimal logarithmic time randomized suffix tree construction. International Colloquium on Automata, Languages and Programming (ICALP '96). Lecture Notes in Computer Science. 1996;Springer-Verlag, New York/Berlin. p. 550-561.
11. Ferragina P., Grossi R., Montangero M. A note on updating suffix-tree labels. Italian Conference on Algorithms and Complexity (CIAC '97). Lecture Notes in Computer Science. 1203:1997;Springer-Verlag, New York/Berlin. p. 181-192.
12. Fiala E. R., Green D. H. Data compression with finite windows. Comm. Assoc. Comput. Mach. 32:1988;490-505.
13. Fortune S., Wyllie J. Parallelism in random access machines. Proc. 10th Symposium on Theory of Computing. Assoc. Comput. Mach. 1978;. p. 114-118.
14. R. Giancarlo, 1993, An index data structure for matrices, with applications to fast two-dimensional pattern matching, Proc. of Workshop on Algorithms and Data Structures, 337, 348, Lecture Notes in Comput. Sci. Springer-Verlag, New York/Berlin, 1993.
15. R. Giancarlo, 1993, An index data structure for matrices, with applications to fast two-dimensional pattern matching, Proc. of Workshop on Algorithms and Data Structures, 337, 348, Lecture Notes in Comput. Sci. Springer-Verlag, New York/Berlin, 1993.
16. Giancarlo R. A generalization of the suffix tree to square matrices, with applications. SIAM J. Comput. 24:1995;520-562.
17. Giancarlo R., Grossi R. Parallel construction and query of suffix trees for two-dimensional matrices. Proc. of the 5th ACM Symposium on Parallel Algorithms and Architectures. 1993;. p. 86-97.
18. Giancarlo R., Grossi R. On the construction of classes of suffix trees for square matrices: Algorithms and applications. Inform. and Comput. 130:1996;151-182.
19. Gonnet G. H. Technical Report. 1988.
20. Hariharan R. Optimal parallel suffix tree construction. Proc. the 26th Symposium on Theory of Computing. Assoc. Comput. Mach. 1994;. p. 290-299.
21. Hilbert D. Über stetige Abbildung einer Linie auf ein Flachenstuck. Math. Ann. 38:1891;459-460.
22. Idury I., Schaffer A. Multiple matching of rectangular patterns. Proc. the 25th Symposium on Theory of Computing, Assoc. Comput. Mach. 1993;. p. 81-90.
23. Jain R. Technical Report. 1992.
24. Knuth D. E. The Art of Computer Programming. Vol. 3. Sorting and Searching. 1973;Addison-Wesley, Reading.
25. Kosaraju R. S. Real-time pattern matching and quasi-real-time construction of suffix trees. Proc. the 26th Symposium on Theory of Computing. Assoc. Comput. Mach. 1994;. p. 310-316.
26. Larsson N. Jesper. Extended application of suffix tree to data compression. Proc. Data Compression Conference. IEEE. 1996;. p. 190-199.
27. Lempel A., Ziv J. On the complexity of finite sequences. IEEE Trans. Inform. Theory. 22:1976;75-81.
28. Lempel A., Ziv J. Compression of two-dimensional data. IEEE Trans. Inform. Theory. 32:1986;2-8.
29. McCreight E. M. A space economical suffix tree construction algorithm. Assoc. Comput. Mach. 23:1976;262-272.
30. Peano G. Sur une courbe qui remplit toute une aire plaine. Math. Ann. 36:1890;157-160.
31. Rodeh M., Pratt V. R., Even S. Linear time algorithm for data compression via string matching. J. Assoc. Comput. Match. 28:1981.
32. Rosenfield A., Kak A. C. Digital Picture Processing. 1982;Academic Press, San Diego.
33. Sahinalp S. C., Vishkin U. Symmetry breaking for suffix tree construction. Proc. the 26th Symposium on Theory of Computing. Assoc. Comput. Mach. 1982;. p. 300-309.
34. Sheinwald D., Lempel A., Ziv J. Two-dimensional encodings by finite state encoders. IEEE Trans. Comm. 38:1992;341-347.
35. Sleator D. D., Tarjan R. E. A data structure for dynamic trees. J. Comput. System Sci. 26:1983;362-391.
36. Slisenko A. O. Detection of periodicities and string matching in real time. J. Soviet Math. 22:1983;1316-1386.
37. Storer J. Data Compression: Methods and Theory. 1988;Comput. Sci. Press, Rockville.
38. Storer J. A. Lossles image compression using generalized LZ1-type methods. Proc. Data Compression Conference. IEEE. 1996;. p. 290-299.
39. Ukkonen E. On-line construction of suffix trees. Algorithmica. 14:1995;249-260.
40. Wiener P. Linear pattern matching algorithms. Proc. 14th Symposium on Switching and Automata Theory. IEEE. 1973;. p. 1-11.
41. Ziv J., Lempel A. A universal algorithm for sequential data compression. IEEE Trans. Inform. Theory. 23:1977;337-343.