Incremental Text Editing: A New Data Structure

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.

[1]  Zvi Galil.  Optimal Parallel Algorithms for String Matching , 1985, Inf. Control..

[2]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[3]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[4]  Richard M. Karp,et al.  Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[5]  S. Rao Kosaraju,et al.  Efficient tree pattern matching , 1989, 30th Annual Symposium on Foundations of Computer Science.

[6]  Gad M. Landau,et al.  An Efficient Algorithm for the All Pairs Suffix-Prefix Problem , 1992, Inf. Process. Lett..

[7]  J. Seiferas,et al.  Efficient and Elegant Subword-Tree Construction , 1985 .

[8]  Ramesh Hariharan,et al.  Optimal parallel suffix tree construction , 1994, STOC '94.

[9]  Ming Gu,et al.  An efficient algorithm for dynamic text indexing , 1994, SODA '94.

[10]  Alfred V. Aho,et al.  Algorithms for Finding Patterns in Strings , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[11]  Donald E. Knuth,et al.  Fast Pattern Matching in Strings , 1977, SIAM J. Comput..

[12]  Christoph M. Hoffmann,et al.  Pattern Matching in Trees , 1982, JACM.

[13]  Bernard Chazelle.  Filtering Search: A New Approach to Query-Answering , 1983, FOCS.

[14]  Amihood Amir,et al.  Adaptive dictionary matching , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[15]  Fabrizio Luccio,et al.  Coding Trees as Strings for Approximate Tree Matching , 1993 .

[16]  Edward M. McCreight,et al.  A Space-Economical Suffix Tree Construction Algorithm , 1976, JACM.

[17]  Erkki Mäkinen.  On the Subtree Isomorphism Problem for Ordered Trees , 1989, Inf. Process. Lett..

[18]  Arnold L. Rosenberg,et al.  Rapid identification of repeated patterns in strings, trees and arrays , 1972, STOC.

[19]  Robert S. Boyer,et al.  A fast string searching algorithm , 1977, CACM.

[20]  Dan E. Willard,et al.  New Data Structures for Orthogonal Range Queries , 1985, SIAM J. Comput..