Complexity of substring search in a set of strings
type: Item
instance of: scholarly article
title: Complexity of substring search in a set of strings
zbMATH Open document ID: 1400.68265
DOI: 10.3103/S0027132218030038
author: E. M. Perper
published in: Moscow University Mathematics Bulletin
publication date: 2018-10-10T00:00:00Z
Mathematics Subject Classification ID: 68W32
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6951202
MaRDI profile type: Publication
cites work: Fast Pattern Matching in Strings
cites work: On improving the worst case running time of the Boyer-Moore string matching algorithm
cites work: Q4799839
full work available at URL: s0027132218030038
OpenAlex ID: W2850045997
Recommended article: Lower bounds of temporal and spatial complexity of the substring search problem
Recommended article: The complexity of searching a sorted array of strings
Recommended article: Fundamentals of Computation Theory
Recommended article: On the complexity of finding common approximate substrings.
Recommended article: Parameterized intractability of distinguishing substring selection
Recommended article: Q5874430
Recommended article: Position-Restricted Substring Searching
Recommended article: A family of fast constant-space substring search algorithms
Recommended article: Constant-space string-matching in sublinear average time
Recommended article: Algorithms – ESA 2005
description: scientific article; zbMATH DE number 6951202