Sciweavers

Share
SOFSEM
2016
Springer

A Fast Order-Preserving Matching with q-neighborhood Filtration Using SIMD Instructions

3 years 9 days ago
A Fast Order-Preserving Matching with q-neighborhood Filtration Using SIMD Instructions
The order-preserving matching problem is a variant of the pattern matching problem focusing on shapes of sequences instead of values of sequences. Given a text and a pattern, the problem is to output all positions where the pattern and a subsequence in the text are of the same relative order. Chhabra and Tarhio proposed a fast algorithm based on filtration for the order-preserving matching problem, and Faro and K¨ulekci improved Chhabra and Tarhio’s solution by extending the filter. Furthermore, Cantone et al. and Chhabra et al. proposed solutions based on filtration using SIMD (Single Instruction Multiple Data) instructions, and showed that SIMD instructions are efficient in speeding up their algorithms. In this paper, we propose a fast matching algorithm for the orderpreserving matching problem using SIMD instructions based on filtration proposed by Faro and K¨ulekci. We show that our algorithm is practically faster than previous solutions.
Yohei Ueki, Kazuyuki Narisawa, Ayumi Shinohara
Added 09 Apr 2016
Updated 09 Apr 2016
Type Journal
Year 2016
Where SOFSEM
Authors Yohei Ueki, Kazuyuki Narisawa, Ayumi Shinohara
Comments (0)
books