Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
Lower bounds of temporal and spatial complexity of the substring search problem
Veröffentlicht/Copyright:
25. November 2014
Abstract
We consider the problem of substring search in a set of strings. The problem is the following: given a set of strings and an arbitrary substring, list all strings from the set that contain this substring.We describe search algorithms and obtain lower bounds for the running time and for the memory volume required by the fastest algorithms
Published Online: 2014-11-25
Published in Print: 2014-12-1
© 2014 by Walter de Gruyter Berlin/Boston
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- Frontmatter
- On the asymptotic normality of the number of empty cells in a scheme of group allocation of particles
- Branching processes in a Markov random environment
- Properties of Boolean functions without three-argument implicents
- On the fraction of matrices with maximal additive complexity
- On the maximum size of a tree in the Galton–Watson forest with a bounded number of vertices
- Lower bounds of temporal and spatial complexity of the substring search problem
Artikel in diesem Heft
- Frontmatter
- On the asymptotic normality of the number of empty cells in a scheme of group allocation of particles
- Branching processes in a Markov random environment
- Properties of Boolean functions without three-argument implicents
- On the fraction of matrices with maximal additive complexity
- On the maximum size of a tree in the Galton–Watson forest with a bounded number of vertices
- Lower bounds of temporal and spatial complexity of the substring search problem
