Skip to main content
SpringerLink
Log in
Book cover

European Symposium on Algorithms

ESA 1994: Algorithms — ESA '94 pp 495–507Cite as

Incremental text editing: a new data structure

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 855))

Abstract

We present new sequential and CRCW-PRAM parallel algorithms for the incremental text editing problem, in which a text string T=αβγ over an alphabet Σ is dynamically changed to a new text T′=αδγ by replacing the substring β with another string γ, where α,β,γ,δ ∈ Σ *. The dynamically changes of the text axe interleaved with on-line queries for finding the occurrences of a pattern string.

This paper has been supported in part by M.U.R.S.T. of Italy.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. V. Aho. Algorithms for finding patterns in strings, chapter A, 255–300. Handbook of Theoretical Computer Science. MIT press, Cambridge, 1990.

    Google Scholar 

  2. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The design and analysis of computer algorithms. Addison-Wesley, 1974.

    Google Scholar 

  3. A. Amir, M. Farach. Adaptive dictionary matching. Proc. of IEEE Symposium on Foundations of Computer Science, 760–766, 1991.

    Google Scholar 

  4. A. Apostolico, C. Iliopolus, G. M. Landau, B. Schieber, and U. Vishkin. Parallel construction of a suffix tree with applications. Algorithmica, 3:347–365, 1988.

    Article  MathSciNet  Google Scholar 

  5. R. S. Boyer and J. S. Moore. A fast string searching algorithm. Communications of the ACM, 20:762–772, 1977.

    Article  Google Scholar 

  6. B. M. Chazelle. Filtering search: a new approach to query answering. SIAM Journal of Computing, 15:703–724, 1986.

    MATH  MathSciNet  Google Scholar 

  7. M. T. Chen and J. Seiferas. Efficient and elegant subword tree construction. Combinatorial algorithms in word, 97–107. Springer-Verlag, 1985.

    Google Scholar 

  8. Z. Galil. Optimal parallel algorithms for string matching. Information and Control, 67:144–157, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  9. M. Gu, M. Farach, and R. Beigel. An efficient algorithm for dynamic text editing. ACM-SIAM Symposium on Discrete Algorithms, 1994.

    Google Scholar 

  10. R. Grossi, F. Luccio, and L. Pagli. Coding trees as strings for approximate tree matching, 245–259. Sequences II: Methods in Communication, Security and Computer Science, 1992.

    Google Scholar 

  11. D. Gusfield, G. M. Landau, and B. Schieber. An efficient algorithm for all pairs suffix-prefix problem. Information Processing Letters, 41:181–185, 1992.

    Article  MathSciNet  Google Scholar 

  12. R. Hariharan. Optimal parallel suffix tree construction. ACM Symposium on Theory of Computing, 1994.

    Google Scholar 

  13. C. M. Hoffmann and M. J. O'Donnell. Pattern matching in trees. Journal of the ACM, 29:68–95, 1982.

    Article  MathSciNet  Google Scholar 

  14. R. M. Karp and V. Ramachandran. A survey of parallel algorithms for shared memory machines, chapter 17, 869–941. Handbook of Theoretical Computer Science. Elsevier Science Publisher B.V., j. van Leeuwen edition, 1990.

    Google Scholar 

  15. R. Karp, R. Miller, and A. Rosenberg. Rapid identification of repeated patterns in strings, arrays and trees. In Proc. 4th Symposium on Theory of Computing, pages 125–136. ACM, 1972.

    Google Scholar 

  16. M. Kempf, R. Bayer, and U. Guntzer. Time optimal left to right construction of position trees. Acta Informatica, 24:475–489, 1987.

    Article  MathSciNet  Google Scholar 

  17. D. E. Knuth, J. H. Morris, and V. R. Pratt. Fast pattern matching in strings. SIAM Journal of Computing, 6(2):63–78, 1977.

    Article  MathSciNet  Google Scholar 

  18. S.R. Kosaraju. Efficient tree pattern matching. Proc. IEEE Symposium on Foundations of Computer Science, 178–183, 1989.

    Google Scholar 

  19. E. Mäkinen. On the subtree isomorphism problem for ordered trees. Information Processing Letters, 32:271–273, 1988.

    Google Scholar 

  20. E. M. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23(2):262–272, 1976.

    Article  MATH  MathSciNet  Google Scholar 

  21. E. Ukkonen. On-line construction of suffix tree. Technical Report A-1/93, Dept. of Computer Science, University of Helsinki, Finland, 1993.

    Google Scholar 

  22. D. E. Willard. New data structures for orthogonal range queries. SIAM Journal of Computing, 14:232–253, 1985.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Corso Italia, 40, 56125, Pisa, Italy

    Paolo Ferragina

Authors
  1. Paolo Ferragina
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ferragina, P. (1994). Incremental text editing: a new data structure. In: van Leeuwen, J. (eds) Algorithms — ESA '94. ESA 1994. Lecture Notes in Computer Science, vol 855. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0049434

Download citation

  • DOI: https://doi.org/10.1007/BFb0049434

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58434-6

  • Online ISBN: 978-3-540-48794-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation