Constructing suffix arrays for multi-dimensional matrices

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

Volumn 1448 LNCS, Issue , 1998, Pages 126-139

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

^a Seoul National University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; FORESTRY; MATRIX ALGEBRA; PATTERN MATCHING;

CONSTRUCTION ALGORITHMS; INDEX DATA STRUCTURES; LARGE AMOUNTS; MULTI DIMENSIONAL; MULTI-DIMENSIONAL MATRICES; PARTITIONING TECHNIQUES; SQUARE MATRICES; SUFFIX ARRAYS;

TREES (MATHEMATICS);

EID: 84877328363     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0030786     Document Type: Conference Paper

References (22)

1. A. V. Aho, J. E. Hopcroft and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
2. A. Amir and M. Farach, Two-dimensional dictionary matching, Inform. Processing Letters 21 (1992), 233-239.
3. A. Amir, G. Benson and M. Farach, An alphabet independent approach to twodimensional pattern matching, SIAM J. Comput. 23 (1994), 313-323.
4. A. Apostolico, The myriad virtues of subword trees, Combinatorial Algorithms on Words, Springer-Verlag, (1985), 85-95
5. M. Crochemore, An optimal algorithm for computing the repetitions in a word, Inform. Processing Letters 12 (1981), 244-250.
6. Z. Galil and K. Park, Alphabet-independent two-dimensional witness computation, SIAM J. Comput. 25, (1996), 907-935.
7. R. Giancarlo, A generalization of the suffix tree to square matrices with application, SIAM J. Comput. 24, (1995), 520-562.
8. D. Gusfield, Algorithms on Strings, Trees, and Sequences, Cambridge Univ. Press, 1997.
9. J. E. Hopcroft, An n log n algorithm for minimizing states in a finite automaton, in Kohavi and Paz, eds., Theory of Machines and Computations, Academic Press, New York, 1971.
10. C. S. Iliopoutos, D. W. G. Moore and K. Park, Covering a string, Algorithmica 16 (1996), 288-297.
11. J. Kärkkäinen, A cross between suffix tree and suffix array, Syrup. Combinatorial Pattern Matching (1995), 191-204.
12. G. M. Landau and U. Vishkin, Fast parallel and serial approximate string matching, J. Algorithms 10 (1989), 157-169.
13. S. E. Lee and K. Park, A new algorithm for constructing suffix arrays, J. Korea Information Science Society 24 (1997), 697-703 (written in Korean).
14. U. Manber and G. Myers, Suffix arrays: A new method for on-line string searches, SIAM J. Comput. 22, (1993), 935-938.
15. E. M. McCreight, A space-economical suffix tree construction algorithms, J. ACM 23 (1976), 262-272.
16. R. Paige and R. E. Tarjan, Three partition refinement algorithms, SIAM J. Comput. 16, (1987), 973-989.
17. R. Paige, R. E. Tarjan and R. Bonic, A linear time solution to the single function coarsest partition problem, Theoret. Comput. Sci. 40, (1985), 67-84.
18. B. Schieber and U. Vishkin, On finding lowest common ancestors: simplification and parallelization, SIAM J. Comput. 17, (1988), 1253-1262.
19. D. D. Sleater and R. E. Tarjan, A data structure for dynamic trees, . I. Comput. System Sci. 26, (1983), 362-391.
20. D. D. Sleater and R. E. Tarjan, Self-adjusting binary search trees, J. ACM 32, (1985), 652-686.
21. E. Ukkonen and D. Wood, Approximate string matching with suffix automata, Algorithmica 10 (1993), 353-364.
22. P. Weiner, Linear pattern matching algorithms, Proc. 14th IEEE Syrup. Switching and Automata Theory (1973), 1-11.