On the average-case complexity of pattern matching with wildcards

Pattern matching with wildcards is a string matching problem with the goal of finding all factors of a text t of length n that match a pattern x of length m, where wildcards (characters that match everything) may be present. In this paper we present a number of complexity results and fast average-ca...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 922; pp. 37 - 45
Main Author:	Barton, Carl
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 24.06.2022
Subjects:	Average case complexity Pattern matching Pattern matching with don't care symbols Pattern matching with wildcards Stringology Average case complexity Pattern matching with don't care symbols Stringology Pattern matching with wildcards Pattern matching
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!