Skip to main content

The Myriad Virtues of Subword Trees

  • Conference paper
Combinatorial Algorithms on Words

Part of the book series: NATO ASI Series ((NATO ASI F,volume 12))

Abstract

Several nontrivial applications of subword trees have been developed since their first appearance. Some such applications depart considerably from the original motivations. A brief account of them is attempted here.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Aho, A., and Corasick, MJ., Efficient String Matching: An Aid to Bibliographic Search, CACM 18, 335–340 (1975).

    MathSciNet  Google Scholar 

  2. Aho, A., Hoperoft, J.E., Ullman, J.D., The Design and Analysis of Computer Algorithms, Addison Wesley, Reading (1974).

    MATH  Google Scholar 

  3. Apostolico, A., On Context Constrained Squares and Repetitions in a String, RAJR.O. Journal Theoretical Informatics 18, 2, 147–159 (1984).

    MathSciNet  MATH  Google Scholar 

  4. Apostolico, A., Giancarlo, R., Pattern Matching Machine Implementation of a Fast Test for Unique Decipherability, Inf. Proc. Letters 18, 155–158 (1984).

    Article  MathSciNet  Google Scholar 

  5. Apostolico, A., Guerrieri, E., Linear Time Universal Compression Techniques for Dithered Images Based on Pattern Matching (extended abstract), Proceedings of the 21st Allerton Conference on Communication, Control and Computing, 70–79 (1983).

    Google Scholar 

  6. Apostolico, A., Preparata, F.P., Optimal Off-line Detection of Repetitions in a String, Theoretical Computer Science, 22, 297–315 (1983).

    Article  MathSciNet  MATH  Google Scholar 

  7. Apostolico, A., Preparata, F.P., The String Statistics Problem, Tech. Report, Purdue Univ. CS Dept. (1984). A preliminary version: A Structure for the Statistics of all Substrings of a Textstring With and Without Overlap, Proceedings of the 2nd World Conference on Math. at the Service of Man, 104–109 (1982).

    Google Scholar 

  8. Blumer, A., Blumer, J., Ehrenfeucht, A., Haussier, D., McConnell, R., Building a Complete Inverted File for a Set of Text Files in Linear Time, Proceedings of the 16th ACM STOC, 349–358 (1984).

    Google Scholar 

  9. Blumer, A., Blumer, J., Ehrenfeucht, A., Haussier, D., McConnel, R., Building the Minimal DFA for the Set of All Subwords of a Word On-line in Linear Time, Springer-Verlag Lecture Notes in Computer Science 172, 109–118 (1984).

    Google Scholar 

  10. Capocelli, R.M., Hoffmann, C.H., Algorithms For Factorizing and Testing Subsemigroups, Combinatorial Algorithms on Words (A. Apostolico and Z. Galil, eds.) Springer-Verlag (1985).

    Google Scholar 

  11. Crochemore, M., An Optimal Algorithm for Computing the Repetitions in a Word, Inf. Proc. Letters 12, 5, 244–250 (1981).

    Article  MathSciNet  MATH  Google Scholar 

  12. Crochemore, M., Recherche Lineaire d’un Carre dans un Mot, CR. Acad. Sc. Paris, t296, Serie I, 781–784 (1983).

    Google Scholar 

  13. Crochemore, M., Optimal Factor Transducers, Combinatorial Algorithms on Words (A. Apostolico and Z. Galil, eds.) Springer-Verlag (1985).

    Google Scholar 

  14. Chen, M.T., Seiferas, J., Additional Notes on Subword Trees, unpublished lecture notes (1982).

    Google Scholar 

  15. Chen, M.T., Seiferas, J., Efficient and Elegant Subword Tree Construction, Combinatorial Algorithms on Words (A. Apostolico and Zvi Galil, eds. ), Springer-Verlag (1985).

    Google Scholar 

  16. Fraenkel, A. S., Klein, S. T., Novel Compression of Sparse Bit Strings, Combinatorial Algorithms on Words (A. Apostolico and Z. Galil, eds.) Springer-Verlag (1985)

    Google Scholar 

  17. Knuth, D.E., Morris, J.H., Pratt, V.R., Fast Pattern Matching in Strings, SIAM Journal on Computing 6, 2, 323–350 (1977).

    Article  MathSciNet  MATH  Google Scholar 

  18. Karp, R.M., Miller, R.E., Rosenberg, A.L., Rapid Identification of Repeated Patterns in Strings, Trees, and Arrays, Proceedings of the 4th ACM STOC, 125–136 (1972).

    Google Scholar 

  19. Knuth, D.E., The Art of Computer Programming, Vol. 3: Sorting and Searching, Addison-Wesley, MA (1973).

    Google Scholar 

  20. Lyndon, R.C., Schiitzenberger, M.P., The Equation a m =0c“ in a Free Group, Michigan Math. Journal 9, 289–298 (1962).

    Article  MATH  Google Scholar 

  21. Lempel, A., Ziv, J., On the Complexity of Finite Sequences, IEEE TIT 22, 1, 75–81 (1976).

    MathSciNet  MATH  Google Scholar 

  22. Lempel, A., Ziv, J., Compression of Two-dimensional Images, Combinatorial Algorithms on Words (A. Apostolico and Z. Galil, eds.) Springer-Verlag (1985).

    Google Scholar 

  23. Manacher, G., A New Linear-time On-line Algorithm for Finding the Smallest Initial Palindrome of a String, JACM 22, 346–351 (1975).

    Article  MATH  Google Scholar 

  24. Majster, M.E., Reisner, A., Efficient On-line Construction and Correction of Position Trees, SIAM Journal on Computing 9, 4, 785–807 (1980).

    Article  MathSciNet  MATH  Google Scholar 

  25. McCreight, E.M., A Space Economical Suffix Tree Construction Algorithm, JACM 23, 2, 262–272 (1976).

    Article  MathSciNet  MATH  Google Scholar 

  26. Main, M.G., Lorentz, RJ., An O(nlogn) Algorithm for Finding all Repetitions in a String, Journal of Algorithms, 422–432 (1984).

    Google Scholar 

  27. Main, M.G., Lorentz, R.J., Linear Time Recognition of Square-Free Strings, Combinatorial Algorithms on Words, (A. Apostolico and Z. Galil, eds.) Springer-Verlag (1984).

    Google Scholar 

  28. Morrison, D.R., PATRICIA — Practical Algorithm to Retrieve Information Coded in Alphanumeric, JACM 15, 4, 514–534 (1968).

    Article  Google Scholar 

  29. Miller, V.S., Wegman, M.N., Variations on a Theme by Ziv and Lempel, Combinatorial Algorithms on Words (A. Apostolico and Z. Galil, eds.) Springer-Verlag (1985).

    Google Scholar 

  30. Pratt, V.R., Improvements and Applications for the Weiner Repetition Finder, unpublished manuscript (1975).

    Google Scholar 

  31. Rabin, M.O., Discovering Repetitions in Strings, Combinatorial Algorithms on Words (A. Apostolico and Z. Galil, eds. ), Springer-Verlag (1985).

    Google Scholar 

  32. Rodeh, M., A Fast Test for Unique Decipherability Based on Suffix Trees, IEEE TIT 28, 648–651 (1982).

    Google Scholar 

  33. Rodeh, M., Pratt, V.R., and Even, S., Linear Algorithms for Data Compression via String Matching, JACM 28, 1, 16–24 (1981).

    Article  MathSciNet  MATH  Google Scholar 

  34. Seiferas, J., Subword Trees, unpublished lecture notes (1977).

    Google Scholar 

  35. Slisenko, A.O., Detection of Periodicities and String Matching in Real Time, Journal of Soviet Mathematics 22, 3, 1316–1387 (1983).

    Article  MATH  Google Scholar 

  36. Storer, J.A., Textual Substitution Techniques for Data Compression, Combinatorial Algorithms on Words (A. Apostolico and Z. Galil, eds.) Springer-Verlag (1985).

    Google Scholar 

  37. Seery, J.B., Ziv, J., A Universal Data Compression Algorithm: Description and Preliminary Results, Bell Labs TM77–1212–6/77–1217–6 (1977).

    Google Scholar 

  38. Seery, J.B., Ziv, J., Further Results on Universal Data Compression, Bell Labs, TM78–1212–8/78–1217–11 (1978).

    Google Scholar 

  39. Thue, A., Uber Die Gegenseitige Lage Gleicher Teile Gewisser Zeichenreichen, Skr. Vid. Kristiana I. Math. Naturv. Klasse 1, 7–67 (1912).

    Google Scholar 

  40. Weiner, P., Linear Pattern Matching Algorithms, Proceedings of the 14th Annual Symposium on Switching and Automata Theory, 1–11 (1973).

    Google Scholar 

  41. Ziv, J., Coding Theorems for Individual Sequences, IEEE TIT 24, 4, 405–413 (1978).

    MathSciNet  MATH  Google Scholar 

  42. Ziv, J., Lempel, A., A Universal Algorithm for Sequential Data Compression, IEEE TIT 23, 3, 337–343 (1977).

    MathSciNet  MATH  Google Scholar 

  43. Ziv, J., Lempel, A., Compression of Individual Sequences On Variable Length Encoding, IEEE TIT 24, 5, 530–536 (1978).

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Apostolico, A. (1985). The Myriad Virtues of Subword Trees. In: Apostolico, A., Galil, Z. (eds) Combinatorial Algorithms on Words. NATO ASI Series, vol 12. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-82456-2_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-82456-2_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-82458-6

  • Online ISBN: 978-3-642-82456-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics