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

Celý popis

Podrobná bibliografie

Vydáno v:	Theoretical computer science Ročník 922; s. 37 - 45
Hlavní autor:	Barton, Carl
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 24.06.2022
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!