Generalizations of suffix arrays to multi-dimensional matrices

Theoretical Computer Science

Volumn 302, Issue 1-3, 2003, Pages 401-416

  Kim, Dong Kyue ^a   Kim, Yoo Ah ^b   Park, Kunsoo ^c  

^a Pusan National University   (South Korea)

^b Institute of Advanced Computer Science   (United States)

^c Seoul National University   (South Korea)

Author keywords

Index data structure; Multi dimensional matrices; Pattern retrieval; Suffix array

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; MATRIX ALGEBRA; PATTERN RECOGNITION;

MULTI-DIMENSIONAL MATRICES;

DATA STRUCTURES;

EID: 0038238509     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00861-7     Document Type: Article

References (30)

1. Aho A.V., Hopcroft J.E., Ullman J.D. The Design and Analysis of Computer Algorithms. 1974;Addison-Wesley, Reading, MA.
2. Amir A., Benson G., Farach M. An alphabet independent approach to two-dimensional pattern matching. SIAM J. Comput. 23:1994;313-323.
3. Amir A., Farach M. Two-dimensional dictionary matching. Inform. Process. Lett. 21:1992;233-239.
4. Apostolico A. The myriad virtues of subword trees. Apostolico A., Galil Z. Combinatorial Algorithms on Words. 1985;85-95 Springer, Berlin.
5. Chen M.T., Seiferas J. Efficient and elegant subword tree construction. Apostolico A., Galil Z. Combinatorial Algorithms on Words. 1985;97-107 Springer, Berlin.
6. Crochemore M. An optimal algorithm for computing the repetitions in a word. Inform. Process. Lett. 12:1981;244-250.
7. Crochemore M., Rytter W. Text Algorithms. 1994;Oxford University Press, Oxford.
8. Farach-Colton M., Ferragina P., Muthukrishnan S. On the sorting-complexity of suffix tree construction. J. Assoc. Comput. Mach. 47:2000;987-1011.
9. Galil Z., Park K. Alphabet-independent two-dimensional witness computation. SIAM J. Comput. 25:1996;907-935.
10. Giancarlo R. A generalization of the suffix tree to square matrices with application. SIAM J. Comput. 24:1995;520-562.
11. R. Giancarlo, R. Grossi, Parallel construction and query of suffix trees for two-dimensional matrices, ACM Symposium on Parallel Algorithms and Architectures, 1993, pp. 86-97.
12. 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.
13. Giancarlo R., Grossi R. Suffix tree data structures for matrices. Apostolico A., Galil Z. Pattern Matching Algorithms, Chap. 11. 1997;293-340 Oxford University Press, Oxford.
14. Giancarlo R., Grossi R. Multi-dimensional pattern matching with dimensional wildcards. data structures and optimal on-line search algorithms J. Algorithms. 24:1997;223-265.
15. G.H. Gonnet, Efficient searching of text and pictures, Tech. Report, University of Waterloo OED-88-02, 1988.
16. D. Gusfield, An "Increment-by-one" approach to suffix arrays and trees, manuscript, 1990.
17. Gusfield D. Algorithms on Strings, Trees, and Sequences. 1997;Cambridge University Press, Cambridge.
18. Hopcroft J.E. An. n log n algorithm for minimizing states in a finite automaton Kohavi Z., Paz A. Theory of Machines and Computations. 1971;189-196 Academic Press, New York.
19. Iliopoulos C.S., Moore D.W.G., Park K. Covering a string. Algorithmica. 16:1996;288-297.
20. J. Kärkkäinen, A cross between suffix tree and suffix array, Symposium on Combinatorial Pattern Matching, 1995, pp. 191-204.
21. D.K. Kim, Y.A. Kim, K. Park, Constructing suffix arrays for multi-dimensional matrices, Symposium on Combinatorial Pattern Matching, 1998, pp. 126-139.
22. D.K. Kim, K. Park, Linear-time construction of two-dimensional suffix trees, International Colloquium on Automata, Languages and Programming, 1999, pp. 463-472.
23. Landau G.M., Vishkin U. Fast parallel and serial approximate string matching. J. Algorithms. 10:1989;157-169.
24. Manber U., Myers G. Suffix arrays. a new method for on-line string searches SIAM J. Comput. 22:1993;935-938.
25. McCreight E.M. A space-economical suffix tree construction algorithms. J. ACM. 23:1976;262-272.
26. Paige R., Tarjan R.E. Three partition refinement algorithms. SIAM J. Comput. 16:1987;973-989.
27. Paige R., Tarjan R.E., Bonic R. A linear time solution to the single function coarsest partition problem. Theoret. Comput. Sci. 40:1985;67-84.
28. Ukkonen E. On-line construction of suffix trees. Algorithmica. 14:1995;249-260.
29. Ukkonen E., Wood D. Approximate string matching with suffix automata. Algorithmica. 10:1993;353-364.
30. P. Weiner, Linear pattern matching algorithms, Proceedings of the 14th IEEE Symposium on Switching and Automata Theory, 1973, pp. 1-11.