This paper proposed a robust searching algorithm to generate path planning for mobile robot. The searching algorithm employs Laplacian Behaviour-Based Control (LBBC) during space exploration of the environment. The LBBC make use of the potential function in the configuration space to guide its exploration. Laplace’s equation was used to represent the potential function in the configuration spac...

Searching of Information is one of the important aspect in the computer science and varies environment, including the fast growing Internet, requires application with eeective searching technique. We'll look into several aspect on searching and introduce some string matching techniques and algorithms which will be useful in varies needs of searching.

We present a parallel algorithm for two dimensional text searching over a general alphabet. This algorithm is optimal in two ways. First, the total number of operations on the text is linear. Second, the algorithm takes time O(log m) on a CREW PRAM (where m is the length of the longest dimension of the pattern), thus matching the lower bound for string matching on a PRAM without concurrent writ...

Various string matching algorithms have been designed and some experimental works on string matching over nite alphabets have been performed but string matching over innnite alphabets has been little investigated. We present here experimental results where symbols are taken among potentially innnite sets such as integers, reals or composed structures. These results show that in most cases it is...

Background:Improved sequencing techniques have led to large amounts of biological sequence data. One of the challenges in managing sequence data is efficient storage. Recently, referential compression schemes, storing only the differences between a to-be-compressed input and a known reference sequence, gained a lot of interest in this field. However, so far sequences always have to be decompres...

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...

In this paper we consider several variants of the pattern matching problem. In particular, we investigate the following problems: 1) Pattern matching with k mismatches; 2) Approximate counting of mismatches; and 3) Pattern matching with mismatches. The distance metric used is the Hamming distance. We present some novel algorithms and techniques for solving these problems. Both deterministic and...

We derive an efficient parallel algorithm to find all occurrences of a pattern string in a subject string in O(log n) time, where n is the length of the subject string. The number of processors employed is of the order of the product of the two string lengths. The theory of powerlists [2, 3] is central to the development of the algorithm and its algebraic manipulations.

Noncontiguous IO access is the main access pattern in scientific applications. We have designed an algorithm that supports zerocopy noncontiguous PVFS2 IO using a software scatter/gather mechanism over Quadrics. To investigate what impact Quadrics scatter/gather mechanism can have on PVFS2 IO accesses, in this paper, we perform an indepth evaluation of the scatter/gather mechanism. We also stud...