Суффиксный массив для строки представляет собой структуру данных, которая позволяет искать все вхождения образца за линейное время от длины образца. Построены...

This paper intends to analyze, through developed software, the answer of various algorithms to keyword search in random strings problems within the constraint of time and memory space used. The program developed is able to choose, depending on the algorithm used, the maximum number of characters...

An important subtask of the pattern discovery process is pattern matching, where the pattern sought is already known and we want to determine how often and where it occurs in a sequence. In this paper we review the most practical techniques to find patterns of different kinds. We show how...