Skip to main content
SpringerLink
Log in

String matching with constraints

  • Invited Lectures
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1988 (MFCS 1988)

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

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7. References

  1. A.V. Aho & M.J. Corasick, Efficient string matching: An aid to bibliographic search, Comm. ACM18 (1975) 333–340.

    Google Scholar 

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

    Google Scholar 

  3. A. Apostolico & F.P. Preparata, Optimal off-line detection of repetitionsin a string, Theoret. Comput. Sci.22 (1983) 297–315.

    Google Scholar 

  4. D.R. Bean, A. Ehrenfeucht & G.F. McNulty, Avoidable patterns in strings of symbols, Pacific J. Math.85 (1979) 261–294.

    Google Scholar 

  5. A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussler, M.T. Chen & J. Seiferas, The smallest automaton recognizing the subwords of a text, Theoret. Comput. Sci.40, 1 (1985) 31–56.

    Google Scholar 

  6. K.S. Booth, Lexicographically least circular substrings, Inform. Process. Lett.10, 4, 5 (1980) 240–242.

    Google Scholar 

  7. R.S. Boyer & J.S. Moore, A fast string searching algorithm, Comm. ACM20 (1977) 762–772.

    Google Scholar 

  8. Y. Cesari & M. Vincent, Une caractérisation des mots périodiques, C.R. Acad.Sc. t.286, série A (1978) 1175.

    Google Scholar 

  9. C. Choffrut & M.P. Schützenberger, Counting with rationnal functions, to appear in Theoret. Comput. Sci. (1988).

    Google Scholar 

  10. M. Crochemore, Transducers and repetitions, Theoret. Comput. Sci.45 (1986) 63–86.

    Google Scholar 

  11. M. Crochemore & D. Perrin, Pattern matching in strings, to appear in J. Assoc. Comput. Mach. (1988).

    Google Scholar 

  12. J.P. Duval, Factorizing Words over an Ordered Alphabet, J. Algorithms4 (1983) 363–381.

    Google Scholar 

  13. Z. Galil, On improving the most case running time of the Boyer-Moore string-matching algorithm, Comm. ACM22, 9 (1979) 505–508.

    Google Scholar 

  14. Z. Galil, String Matching in real time, J. Assoc. Comput. Mach.28, 1 (1981) 134–149.

    Google Scholar 

  15. Z. Galil & J. Seiferas, Time Space Optimal String Matching, J. Comput. Syst. Sci.26 (1983) 280–294.

    Google Scholar 

  16. L.J. Guibas & A.M. Odlysko, A new proof of the linearity of the Boyer-Moore string searching algorithm, in: (Proc. 18 th Annual IEEE Symposium on Fundations of Computer Science (1977)) 189–195.

    Google Scholar 

  17. R.M. Karp, R.E. Miller & A.L. Rosenberg, Rapid identification of repeated patterns in strings, trees, and arrays, in: (ACM Symposium on Theory of Computing, Vol. 4, ACM, New York (1972)) 125–136.

    Google Scholar 

  18. D.E. Knuth, J.H. Morris & V.R. Pratt, Fast pattern matching in strings, SIAM J. Comput.6, 2 (1977) 323–350.

    Google Scholar 

  19. Lothaire, Combinatorics on Words, Addison-Wesley, Reading, Mass., 1982.

    Google Scholar 

  20. G.M. Landau & U. Vishkin, Efficient string matching with k differences, Technical Report 186, Courant Institute of Mathematical Sciences, New York University (1985).

    Google Scholar 

  21. E.M. McCreight, A space-economical suffix tree construction algorithms, J. Assoc. Comput: Mach.28, 2 (1976) 262–272.

    Google Scholar 

  22. R.L. Rivest, On the worst-case behavior of string-searching algorithms, SIAM J. Comput.6, 4 (1977) 669–674.

    Google Scholar 

  23. W. Rytter, A correct preprocessing algorithm for Boyer-Moore string-searching, SIAM J. Comput.9, 3 (1980) 509–512.

    Google Scholar 

  24. V. Shiloach, Fast canonization of circular strings, J. Algorithms2 (1981) 107–121.

    Google Scholar 

  25. A.O. Slisenko, Detection of periodicities and string-matching in real-time, J. of Soviet Mathematics22, 3 (1983) 1316–1387.

    Google Scholar 

  26. K. Thompson, Regular expression search algorithm, Comm. ACM11 (1968) 419–442.

    Google Scholar 

  27. E. Ukkonen, Finding Approximate Patterns in Strings, J Algorithms6 (1985) 132–137.

    Google Scholar 

  28. U. Vishkin, Optimal parallel pattern matching in strings, in: (Proc. 12th ICALP, Lecture Notes in Computer Science 194, Springer-Verlag (1985)) 497–508.

    Google Scholar 

  29. P. Weiner, Linear pattern matching algorithms, IEEE Symposium on Switching and Automata Theory, Vol. 14, IEEE, New York (1972) 1–11.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université de Paris-Nord, avenue J-B Clément, F - 93430, VILLETANEUSE

    Maxime Crochemore

Authors
  1. Maxime Crochemore
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michal P. Chytil Václav Koubek Ladislav Janiga

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Crochemore, M. (1988). String matching with constraints. In: Chytil, M.P., Koubek, V., Janiga, L. (eds) Mathematical Foundations of Computer Science 1988. MFCS 1988. Lecture Notes in Computer Science, vol 324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017130

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50110-7

  • Online ISBN: 978-3-540-45926-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation