Skip to main content
SpringerLink
Log in

Matching a set of strings with variable length don't cares

  • Conference paper
  • First Online:
Combinatorial Pattern Matching (CPM 1995)

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

Included in the following conference series:

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.

References

  1. A. V. Aho. Algorithms for finding patterns in strings. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science. Elsevier Science Publishers B. V. (North-Holland), 1990.

    Google Scholar 

  2. Amihood Amir and Martin Farach. Adaptive dictionary matching. In Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, San Juan (Puerto Rico), pages 760–766. IEEE computer society press, October 1991.

    Google Scholar 

  3. Amihood Amir, Martin Farach, Zvi Galil, Raffaele Giancarlo, and Park Kunsoo. Dynamic dictionary matching. To appear in Journal of Computer and System Sciences, June 1993.

    Google Scholar 

  4. Amihood Amir, Martin Farach, Ramana M. Idury, Johannes A. La Poutré, and Alejandro A. SchÄffer. Improved dynamic dictionary matching. In Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, Austin (TX), pages 392–401, January 1993. to appear in Information and Computation.

    Google Scholar 

  5. Alan A. Bertossi and Filippo Logi. Parallel string matching with variable length don't cares. Journal of parallel and distributed computing, 22:229–234, 1994.

    Article  Google Scholar 

  6. A. Blumer, J. Blumer, D. Haussier, A. Ehrenfeucht, M. T. Chen, and J. Seiferas. The smallest automaton recognizing the subwords of a text. Theoretical Computer Science, 40:31–55, 1985.

    Article  Google Scholar 

  7. A. Blumer, J. Blumer, D. Haussler, R. McConnell, and A. Ehrenfeucht. Complete inverted files for efficient text retrieval and analysis. Journal of the ACM, 34(3):578–595, July 1987.

    Article  Google Scholar 

  8. Maxime Crochemore. Transducers and repetitions. Theoretical Computer Science, 45:63–86, 1986.

    Article  Google Scholar 

  9. Maxime Crochemore. String matching with constraints. In Proceedings International Symposium on Mathematical Foundations of Computer Science, volume 324 of Lecture Notes in Computer Science, pages 44–58. Springer-Verlag, 1988.

    Google Scholar 

  10. Michael J. Fisher and Michael S. Paterson. String-matching and other products. In R. M. Karp, editor, Complexity of Computation, volume 7 of SIAM-AMS Proceedings, pages 113–125. American Mathematical Society, Providence, RI, 1974.

    Google Scholar 

  11. Ramana M. Idury and Alejandro A. SchÄffer. Dynamic dictionary matching with failure functions. Theoretical Computer Science, 131:295–310, 1994.

    Article  Google Scholar 

  12. G. Kucherov and M. Rusinowitch. Complexity of testing ground reducibility for linear word rewriting systems with variables. In Proceedings 4th International Workshop on Conditional and Typed Term Rewriting Systems, Jerusalem (Israel), July 1994. to appear in the LNCS series.

    Google Scholar 

  13. Udi Manber and Ricardo Baeza-Yates. An algorithm for string matching with a sequence of don't cares. Information Processing Letters, 37:133–136, 1991.

    Article  Google Scholar 

  14. Gene Myers. A four russians algorithm for regular expression pattern matching. Journal of the ACM, 39(4):430–448, April 1992.

    Article  Google Scholar 

  15. Ron Y. Pinter. Efficient string matching with don't-care patterns. In A. Apostolico and Z. Galil, editors, Combinatorial Pattern Matching, volume F12 of ASI Series, pages 11–29. Springer-Verlag, 1985.

    Google Scholar 

  16. Daniel D. Sleator and Robert Endre Tarjan. A data structure for dynamic trees. Journal of Computer and System Sciences, 26:362–391, 1983.

    Article  Google Scholar 

  17. Esko Ukkonen. On-line construction of suffix-trees. Report A-1993-1, University of Helsinki, Department of Computer Science, February 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Campus Scientifique, INRIA-Lorraine and CRIN/CNRS, 615, rue du Jardin Botanique, BP 101, 54602, Villers-lès-Nancy, France

    Gregory Kucherov & MichaËl Rusinowitch

Authors
  1. Gregory Kucherov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. MichaËl Rusinowitch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Zvi Galil Esko Ukkonen

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kucherov, G., Rusinowitch, M. (1995). Matching a set of strings with variable length don't cares. In: Galil, Z., Ukkonen, E. (eds) Combinatorial Pattern Matching. CPM 1995. Lecture Notes in Computer Science, vol 937. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60044-2_46

Download citation

  • DOI: https://doi.org/10.1007/3-540-60044-2_46

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60044-2

  • Online ISBN: 978-3-540-49412-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation