A note on updating suffix tree labels

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

Volumn 1203, Issue , 1997, Pages 181-192

  Ferragina, Paolo ^a   Grossi, Roberto ^b   Montangero, Manuela ^a  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF FLORENCE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FORESTRY;

ACCOUNTING STRATEGY; BI-DIRECTIONAL; COLORING PROBLEMS; INSERTIONS AND DELETIONS; REAL TIME ALGORITHMS; SPACE EFFICIENT; SUFFIX TREE DATA STRUCTURES; SUFFIX-TREES;

TREES (MATHEMATICS);

EID: 80052964072     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62592-5_71     Document Type: Conference Paper

References (25)

1. Aho, A. V., AND Corasick, M. J. Efficient string matching: an aid to bibliographic search. Communication of the ACM 18 (1975), 333-340.
2. Amir, A., and Farach, M. Adaptive dictionary matching. In IEEE Symposium on Foundations of Computer Science (1991), pp. 760-766.
3. Amir, A., Farach, M., Idury, R. M., Poutré, H. L., and Schaffer, A. A. Improved dictionary matching. Information and Computation 119 (1995), 258-282.
4. Apostolico, A., and Preparata, F. Optimal off-line detection of repetitions in a string. Theoretical Computer Science 22 (1983), 297-315.
5. Baker, B. S. A theory of parameterized pattern matching: Algorithms and applications. In ACM Symposium on Theory of Computing (1993), pp. 71-80.
6. Breslauer, D. The suffix tree of a tree and minimizing sequential transducers. In Combinatorial Pattern Matching (1996).
7. Chang, W. I., and Lawler, E. L. Sublinear approximate string matching and biological applications. Algorithmica 12 (1994), 327-344.
8. Cleary, J. G., Teehan, W. J., and Witten, I. H. Unbounded length contexts for PPM. In IEEE Data Compression Conference (1995), pp. 52-61.
9. Ferragina, P., and Grossi, R. Optimal on-line search and sublinear time update in string matching. In IEEE Symposium on Foundations of Computer Science, 604-612, 1995. Also SIAM Journal on Computing (to appear).
10. Fiala, E. R., and Green, D. H. Data compression with finite window. Communication of the ACM 32, 4 (1989), 490-505.
11. Fox, A. E., et al. (eds.) Special Issue on "Digital Libraries" Comm. ACM, 38:4 (1995).
12. Frenkel, K. A. The human genome project and informatics. Communication of the ACM 34 (1991), 41-51.
13. Giancarlo, R. A generalization of the suffix tree to square matrices, with applications. SIAM Journal on Computing 24 (1995), 520-562.
14. Gu, M., Farach, M., and Beigel, R. An efficient algorithm for dynamic text indexing. In ACM-SIAM Symposium on Discrete Algorithms (1994), pp. 697-704.
15. Gusfiēld, D., Landau, G. M., and Schieber, B. An efficient algorithm for all pairs suffix-prefix problem. Information Processing Letters 41 (1992), 181-185.
16. Kosaraju, S.R. Efficient tree pattern matching. In IEEE Foundations of Computer Science (1989), 178-183.
17. Landau, G. M., and Vishkin, U. Fast parallel and serial approximate string matching. Journal of Algorithms 10 (1989), 157-169.
18. Larsson, N. J. Extended application of suffix trees to data compression. In IEEE Data Compression Conference (1996).
19. McCreight, E. M. A space-economical suffix tree construction algorithm. Journal of the ACM 23, 2 (1976), 262-272.
20. Overmars, M. H. The design of Dynamic Data Structures. Springer-Verlag Lecture Notes in Computer Science #156, 1983.
21. Sahinalp S. C. and Vishkin TJ. Efficient approximate and dynamic matching of patterns using a labeling paradigm. In Proc. of IEEE Symposium on Foundations of Computer Science, 1996.
22. Storer, J., and Szymanski, T. Data compression via textual substitution. Journal of the ACM 29, 4 (1982), 928-951.
23. Weiner, P. Linear pattern matching algorithm. In IEEE Symp. on Switching and Automata Theory (1973), pp. 1-11.
24. Ziv, J., AND Lempel, A. A universal algorithm for sequential data compression. IEEE Trans. Info. Theory 23, 3 (1977), 337-343.
25. Ziv, J., and Lempel, A. Compression of individual sequences via variable-rate coding. IEEE Trans. Info. Theory 24, 5 (1978), 530-536.