On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications

Information and Computation

Volumn 130, Issue 2, 1996, Pages 151-182

  Giancarlo, Raffaele ^a,c   Grossi, Roberto ^b  

^a UNIVERSITY OF PALERMO   (Italy)

^b UNIVERSITY OF FLORENCE   (Italy)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002070488     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1996.0087     Document Type: Article

References (35)

1. Abel, D. J., and Mark, D. (1990), A comparative analysis of some two-dimensional orderings, Int. J. Geograph. Inform. Systems 4, 21-31.
2. Adelson-Velskii, G., and Landis, Y. (1962), An algorithm for the organization of information, Sov. Math. Dokl. 3, 1259-1262.
3. Aho, A., Hopcroft, J., and Ullman, J. (1974), "The Design and Analysis of Computer Algorithms," Addison-Wesley, Reading, MA.
4. Amir, A., and Farach, M. (1992), Two-dimensional dictionary matching, Inform. Process. Lett. 44, 233-239.
5. Amir, A., and Farach, M. (1995), Efficient 2-dimensional approximate matching of half-rectangular figures, Inform. and Comput. 118, 1-11.
6. Amir, A., and Landau, G. (1991), Fast parallel and serial multi dimensional approximate array matching, Theoret. Comput. Sci. 81, 97-115.
7. Amir, A., Landau, G., and Vishkin, U. (1992), Efficient pattern matching with scaling, J. Algorithms 13, 2-32.
8. Apostolico, A., Iliopoulos, C., Landau, G., Schieber, B., and Vishkin, U. (1988), Parallel construction of a suffix tree with applications, Algorithmica 3, 347-365.
9. Arlazarov, V., Dinic, E., Kronrod, M., and Faradzev, I. (1970), On economic construction of the transitive closure of a directed graph, Sov. Math. Dokl. 11, 1209-1210.
10. Bayer, R., and McCreight, E. (1972), Organization and maintenance of large ordered indices, Acta Informat. 1, 173-189.
11. Chang, W. I., and Lawler, E. L. (1994), Sublinear approximate string matching and biological applications, Algorithmica 12, 327-344.
12. Crochemore, M., and Rytter, W. (1991), Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays, Theoret. Comput. Sci. 88, 59-82.
13. Galil, Z., and Park, K. (1990). An improved algorithm for approximate string matching, SIAM J. Comput, 19, 989-999.
14. Giancarlo, R. (1993), An index data structure for matrices, with applications to fast two-dimensional pattern matching, in "Proceedings, of Workshop on Algorithms and Data Structures," Lecture Notes in Computer Science, pp. 337-348, Springer-Verlag, Berlin/New York.
15. Giancarlo, R. (1995), A generalization of the suffix tree to square matrices, with applications, SIAM J. Comput. 24, 520-562.
16. Giancarlo, R., and Grossi, R. (1993), Parallel construction and query of suffix trees for two-dimensional matrices, in "Proceedings, of the 5th ACM Symposium on Parallel Algorithms and Architectures," pp. 86-97.
17. Giancarlo, R., and Grossi, R. (1995), On the construction of classes of suffix trees for square matrices: Algorithms and applications, in "Proceedings, of the 22nd International Colloquium on Automata, Languages, and Programming," Lecture Notes in Computer Science, pp. 111-112, Springer-Verlag, Berlin/New York.
18. Gonnet, G. (1988), "Efficient Searching of Text and Pictures - Extended Abstract," Technical Report OED-88-02, University of Waterloo.
19. Guibas, L., and Sedgewick, R. (1978), A dichromatic framework for balanced trees, in "Proceedings, 19th Symposium on Foundations of Computer Science," pp. 8-21, IEEE, New York.
20. Harel, D., and Tarjan. R. E. (1978), Fast algorithms for finding nearest common ancestors, SIAM J. Comput. 13, 338-355.
21. Idury, I., and Schaffer, A. (1995), Multiple matching of rectangular patterns, Inform. and Comput. 117, 78-90.
22. Jain, R. (1992), "Workshop Report on Visual Information Systems," Technical Report, National Science Foundation.
23. JáJá, J. (1992), "An Introduction to Parallel Algorithms," Addison-Wesley, Reading, MA.
24. Johansen, P. (1994), "Combinatorial Pattern Recognition, the Method and the Program Package," Technical Report DIKU 94/10.
25. Karp, R., Miller, R., and Rosenberg, A. (1972), Rapid identification of repeated patterns in strings, arrays and trees, in "Proceedings, 4th Symposium on Theory of Computing," pp. 125-136, ACM.
26. Landau, G., and Vishkin, U. (1989), Fast parallel and serial approximate string matching, J. Algorithms 10, 157-169.
27. Manber, U., and Myers, E. (1993), Suffix arrays: A new method for on-line string searches, SIAM J. Comput. 22, 935-948.
28. Mark, D. (1990), Neighbor-based properties of some orderings of two-dimensional space, Geograph. Anal. 22, 145-157.
29. Mark, D.M., and Goodchild, M. (1986), On the ordering of two-dimensional space: Introduction and relation to tesseral principles, in "Spatial Data Processing Using Tesseral Methods" (B. Diaz and S. Bell, Eds.), pp. 179-192, NERC Unit for Thematic Information Systems.
30. McCreight, E. (1976), A space economical suffix tree construction algorithm, J. Assoc. Comput. Mech. 23, 262-272.
31. Rosenfeld, A., and Kak, A. (1982), "Digital Picture Processing," Academic Press, San Diego.
32. Samet, H. (1990), "The Design and Analysis of Spatial Data Structures," Addison-Wesley, New York.
33. Schieber, B., and Vishkin, U. (1988), On finding lowest common ancestors: Simplification and parallelization, SIAM J. Comput. 17, 1253-1262.
34. Storer, J. A. (1996), Two dimensional suffix tries and their use in lossless sliding window image compression, in "Proceedings, IEEE Data Compression Conference 1996," to appear.
35. Vishkin, U. (1994), Can parallel algorithms enhance serial implementations? in "Proceedings, 8th International Parallel Processing Symposium," pp. 376-385, IEEE.