#### Filter Results:

- Full text PDF available (3)

#### Publication Year

1992

2008

- This year (0)
- Last 5 years (0)
- Last 10 years (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

We present new algorithms for approximate string matching based in simple, but eecient, ideas. First, we present an algorithm for string matching with mismatches based in arithmetical operations that runs in linear worst case time for most practical cases. This is a new approach to string searching. Second, we present an algorithm for string matching with… (More)

- Chris H. Perleberg, Alan Jay Smith
- IEEE Trans. Computers
- 1993

We present an algorithm that minimizes the expected cost of indirect binary search for data with non-constant access costs, such as disk data. Indirect binary search means that sorted access to the data is obtained through an array of pointers to the raw data. One immediate application of this algorithm is to improve the retrieval performance of disk… (More)

We present an algorithm that minimizes the expected cost of indirect binary search for data with non-constant access costs, such as disk data. Indirect binary search means that sorted access to the data is obtained through an array of pointers to the raw data. One immediate application of this algorithm is to improve the retrieval performance of disk… (More)

- Chris H. Perleberg
- Inf. Process. Lett.
- 1994

Single character searching (SCS) methods have wide application in text processing, since many text processing algorithms need to search for a single character in a text string. In this paper, we compare three SCS methods. Two SCS methods are applied to the shift-or patternmatching algorithm of Baeza-Yates and Gonnet [ 2 1, and the performance of the… (More)

- ‹
- 1
- ›