Dynamic Text Indexing under String Updates

Journal of Algorithms

Volumn 22, Issue 2, 1997, Pages 296-328

  Ferragina, Paolo ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346307672     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1996.0814     Document Type: Article

References (38)

1. A. V. Aho, "Handbook of Theoretical Computer Science," Chapter A, "Algorithms for Finding Patterns in Strings," MIT Press, Cambridge, MA, 1990, pp. 255-300.
2. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, "The Design and Analysis of Computer Algorithms," Addison-Wesley, Reading, MA, 1974.
3. A. Amir and M. Farach, Adaptive dictionary matching, in "IEEE Symposium on Foundations of Computer Science, 1991," pp. 760-766.
4. A. Amir, G. M. Landau, and U. Vishkin, Efficient pattern matching with scaling, J. Algorithms 13 (1992), 2-32.
5. A. Apostolico, C. Iliopolus, G. M. Landau, B. Schieber, and U. Vishkin, Parallel construction of a suffix tree with applications, Algorithmica 3 (1988), 347-365.
6. B. S. Baker, A theory of parameterized pattern matching: Algorithms and applications, in "ACM Symposium on Theory of Computing 1993," pp. 71-80.
7. A. Blumer, J. Blumer, D. Haussler, R. McConnel, and A. Ehrenfeucht, Complete inverted files for efficient text retrieval and analysis, J. ACM 34 (1987), 578-595.
8. R. S. Boyer and J. S. Moore, A fast string searching algorithm, Communications ACM 20 (1977), 762-772.
9. M. T. Chen and J. Seiferas, Efficient and elegant subword-tree construction, in "Combinatorial Algorithms in word," (Alberto Apostolico and Zvi Galil, Eds.), NATO ISI Series, Springer-Verlag, 1985, pp. 97-107.
10. P. Ferragina, Incremental text editing: A new data structure, in "European Symposium on Algorithms (ESA '94)," LNCS 885, Springer-Veralg, 1994, pp. 495-507.
11. Z. Galil and R. Giancarlo, Data structures and algorithms for approximate string matching, J. Algorithms 4 (1988), 33-72.
12. R. Giancarlo, A generalization of the suffix tree to square matrices, with applications, SIAM J. Comput. 24 (1995), 520-562.
13. R. Grossi, On finding common subtrees, Theoretical Computer Science 108 (1993), 345-356.
14. R. Grossi, F. Luccio, and L. Pagli, "Coding Trees as Strings for Approximate Tree Matching." Springer-Verlag, 1992, pp. 245-259 (Sequences II: Methods in Communication, Security and Computer Science).
15. M. Gu, M. Farach, and R. Beigel, An efficient algorithm for dynamic text indexing, in "ACM-SIAM Symposium on Discrete Algorithms, 1994," pp. 697-704.
16. R. Hariharan, Optimal parallel suffix tree construction, in "ACM Symposium on Theory of Computing, 1994," pp. 290-299.
17. C. M. Hoffmann and M. J. O'Donnell, Pattern matching in trees, J. ACM 29 (1982), 68-95.
18. M. Kempf, R. Bayer, and U. Guntzer, Time optimal left to right construction of position trees, Acta Informatica 24 (1987), 475-489.
19. D. E. Knuth, J. H. Morris, and V. R. Pratt, Fast pattern matching in strings, SIAM J. Comput. 6(2) (1977), 63-78.
20. S. R. Kosaraju, Efficient tree pattern matching, in "IEEE Symposium on Foundations of Computer Science, 1989," pp. 178-183.
21. R. M. Idury and A. A. Schärfer, Multiple matching of rectangular patterns, Information and Computation 117 (1995), 78-90.
22. D. S. Johnson, A priority queue in which initialization and queue operations take O(log log D) time, Mathematical System Theory 15 (1992), 295-309.
23. G. S. Lueker, A data structure for orthogonal range queries, in "IEEE Symposium on Foundations of Computer Science, 1978," pp. 28-34.
24. M. E. Majster and A. Reiser, Efficient on-line construction and correction of position trees, SIAM J. Comput. 9(4) (1980), 785-807.
25. E. Mäkinen, On the subtree isomorphism problem for ordered trees, Information Processing Lett. 32 (1988), 271-273.
26. U. Manber and G. Myers, Suffix arrays: A new method for on-line string searchers, SIAM J. Comput. 22(5) (1993), 935-948.
27. U. Manber and R. Baeza-Yates, An algorithm for string matching with a sequence of don't cares, Information Processing Lett. 37 (1991), 133-136.
28. E. M. McCreight, A space-economical suffix tree construction algorithm, J. ACM 23(2) (1976), 262-272.
29. R. Karp, R. Miller, and A. Rosenberg, Rapid identification of repeated patterns in strings, arrays and trees, in "ACM Symposium on Theory of Computing, 1972," pp. 125-136.
30. M. H. Overmars, "The Design of Dynamic Data Structures," Lecture Notes in Computer Science No. 156, Springer-Verlag, 1983.
31. M. H. Overmars, Efficient data structures for range searching on a grid, J. Algorithms 9(2) (1988), 254-275.
32. D. Sankoff and J. B. Kruskal, "Time Warps, String Edits, and Macro Molecules: The Theory and Practice of Sequence Comparisons," Addison-Wesley, Reading, MA, 1983.
33. E. Ukkonen, On-line construction of suffix trees, Algorithmica 14(3) (1995), 249-260.
34. P. Weiner, Linear pattern matching algorithm, in "IEEE Symposium on Switching and Automata Theory, 1973," pp. 1-11.
35. D. E. Willard, New trie data structures which support very fast search operations, J. Comput. Syst. Sci. 28 (1984), 379-394.
36. D. E. Willard, New data structures for orthogonal range queries, SIAM J. Comput. 14 (1985), 232-253.
37. K. Zhang and D. Sasha, Simple fast algorithms for the editing distance between trees and related problems, SIAM J. Comput. 18 (1989), 1245-1262.
38. K. Zhang, R. Statman, and D. Sasha, On the editing distance between unordered labeled trees, Information Processing Lett. 42(3) (1992), 133-139.