Efficiency Analysis of Tandem Substring Search Methods

Strings and lists play a fundamental role in data structures. Considering string operations, one of the key functions is the search for matching parts within a given host string. The location of repeating substring pattern is a special type of general substring search. This task is of outstanding importance, among other in biology (examining genes problem) or in process modeling (searching for cycles). This article presents a specific alternative method for tandem substring search which unlike the traditional, direct pattern search methods presents, is based on the application of neural networks. The performed comparative analyzes carried out show that a neural network-based methods is a good alternative, especially in the case of approximate searches.