Learn More
The problem of order-preserving matching is to find all substrings in the text which have the same relative order and length as the pattern. Several online and one offline solution were earlier proposed for the problem. In this paper, we introduce three new solutions based on filtration. The two online solutions rest on the SIMD (Single Instruction Multiple(More)
The problem of order-preserving matching has gained attention lately. The text and the pattern consist of numbers. The task is to find all substrings in the text which have the same relative order as the pattern. The problem has applications in analysis of time series like stock market or weather data. Solutions based on the KMP and BMH algorithms have been(More)
New bit-parallel algorithms for exact and approximate string matching are introduced. TSO is a two-way Shift-Or algorithm, TSA is a two-way Shift-And algorithm , and TSAdd is a two-way Shift-Add algorithm. Tuned Shift-Add is a minimalist improvement to the original Shift-Add algorithm. TSO and TSA are for exact string matching, while TSAdd and tuned(More)
Anatomic variations in maxillary molars are frequent. These deviations are also one of the major cause for endodontic treatment failure owing to inadequate cleaning, shaping and sealing of root canal system. Diagnosis of such aberrations using newer imaging techniques like cone beam computed tomography is firmly advocated. The present paper highlights the(More)
With the increase in life expectancy, there is increase in number of edentulous individuals requiring rehabilitation with complete dentures. Flabby ridge is a commonly encountered condition in clinical practice which affects the retention and stability of the mandibular denture. Two patients reported in K.M. Shah dental college with flabby mandibular(More)
We consider the problem of jumbled matching where the objective is to find all permuted occurrences of a pattern in a text. Besides exact matching we study approximate matching where each occurrence is allowed to contain at most k wrong or superfluous characters. We present online algorithms applying bit-parallelism to both types of jumbled matching. Most(More)
  • 1