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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 922; S. 37 - 45
1. Verfasser:	Barton, Carl
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 24.06.2022
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!