The Apostolico-Giancarlo string-matching algorithm is analyzed precisely. We give a tight upper bound of 3 2 n text characters comparisons when searching for a pattern in a text of length n. We exhibit a family of patterns and texts reaching this bound. We also provide a slightly improved version of the algorithm.

Search algorithms are considered as one of the most important parts of Information Retrieval. In this paper we show diierent algorithms regarding string matching and, speciically, the Shift Or algorithm. As far as eeciency is concerned, this algorithm depends on the pattern lenght which is bounded by the computer word size. Our main interest is to build a modiied version that does not depend on...

the robust coloring problem (rcp) is a generalization of the well-known graph coloring problem where we seek for a solution that remains valid when extra edges are added. the rcp is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. this problem has been proved as np-hard and in instances larger than 30 vertices, meta-...

Forward-SBNDM is a recently introduced variation of the BNDM algorithm for exact string matching. Forward-SBNDM reads a text character following an alignment of the pattern. We present a generalization of this lookahead idea and apply it to SBNDMq for q ≥ 3. As a result we get several new variations of SBNDMq. We introduce a greedy skip loop for SBNDM2. In addition, we tune up our algorithms an...

This paper considers how many character comparisons are needed to find all occurrences of a pattern of length m in a text of length n. The main contribution is to show an upper bound of the form of n + O(n/m) character comparisons, following preprocessing. Specifically, we show an upper bound of n + 8 3(m+1) (n −m) character comparisons. This bound is achieved by an online algorithm which perfo...

We present an animation in Java for exact string matching algorithms [4]. This system provides a framework to animate in a very straightforward way any string matching algorithm which uses characters comparisons. Already 27 string matching algorithms have been animated with this system. It is a good tool to understand all these algorithms.

Recently, a constrained Linear Discriminant Analysis (LDA) algorithm is introduced and gained popularity. However, this algorithm is not applicable in the environment with large amount of data points or when the data point arrive in a sequential manner. In this paper, we aim to propose an incremental version of this algorithm called Incremental Constrained Discriminant Component Analysis (ICDCA...

In this paper, we first derived an equation which can approach the probability of appearing of a pattern string in a text string. From this equation, we see that the probability that a pattern string appears in a text string reduces to 0 quickly as the length of the pattern string increases. Because of this observation, we introduce an algorithm based on the discrete convolution method with an ...

Contact maps are two dimensional abstract representations of protein structures. One of the uses of contact maps is for the identification of patterns which correspond to some known configuration of protein secondary structures. In the past, searching for these patterns has generally used a näıve sliding window approach which is time consuming. We study several approaches that have been used fo...

We present a new indexing method for the approximate string matching problem. The method is based on a suux tree combined with a partitioning of the pattern. We analyze the resulting algorithm and show that the retrieval time is O(n), for 0 < < 1, whenever < 1 ? e= p , where is the error level tolerated and is the alphabet size. We experimentally show that this index outperforms by far all othe...