Skip to main content
Book Chapter

Efficient String Matching with Don’t-Care Patterns

  • Pinter R
Springer Berlin Heidelberg, (1985), 11-29
DOI: 10.1007/978-3-642-82456-2_2
N/ACitations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

… substring in the text. A slight extension to this is the case in which the pattern consists of a finite set of constant strings (the text is still a single constant string)… we want to match that part of …

Cite

CITATION STYLE

APA

Pinter, R. Y. (1985). Efficient String Matching with Don’t-Care Patterns. In Combinatorial Algorithms on Words (pp. 11–29). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-82456-2_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free