The Range Next Value problem (Problem RNV) is a recent interesting variant of the range search problems, where the query is for the immediate next (or equal) value of a given number within a given interval of an array. Problem RNV was introduced and studied very recently by Crochemore et. al [Finding Patterns In Given Intervals, MFCS 2007]. In this paper, we present improved algorithms for Prob...

String matching algorithms play a key role in many computer science problems, and in the implementation of computer software. This problem has received, and continues to receive a great deal of attention due to various applications in text manipulation, information retrieval, speech recognition, image and signal processing and computational biology. In this study, we propose a new algorithm cal...

We use tries to represent combined text and spatial data, and present a range search algorithm for reporting all 2-d points and rectangles from a set of size intersecting a query rectangle. Data and queries can include text. Our -d+ tries are evaluated experimentally (for up to 300,000) using uniform distributed random spatial data and randomly selected strings from a set of place names. For ra...

Exact matching of single patterns in DNA and amino acid sequences is studied. We performed an extensive experimental comparison of algorithms presented in the literature. In addition, we introduce new variations of earlier algorithms. The results of the comparison show that the new algorithms are efficient in practice.

In this article we present two efficient variants of the BOM string matching algorithm which are more efficient and flexible than the original algorithm. We also present bitparallel versions of them obtaining an efficient variant of the BNDM algorithm. Then we compare the newly presented algorithms with some of the most recent and effective string matching algorithms. It turns out that the new ...

We describe a new method for decomposing planar sets of segments and points. Using this method we obtain new efficient deterministic algorithms for counting pairs of intersecting segments, and for answering off-line triangle rang'e queries. In particular we obtain the following results: (1) Given n segments in the plane, the number K of pairs of intersecting segments is computed in time O(nl+ f...