Search Results - "Bit-parallel algorithms"

An Efficient Algorithm for Continuous Complex Event Matching Using Bit-Parallelism by Qiu, Tao, Jiang, Shenwang, Yang, Xiaochun, Wang, Bin, Zong, Chuanyu, Zhu, Rui

“…Complex event matching has gained a lot of at-tention for evaluating complex queries over event streams. The events composing a complex event occur within a…”
Get full text

Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism by Kaneta, Yusaku, Arimura, Hiroki, Raman, Rajeev

“…In this paper, we consider the unordered pseudo-tree matching problem, which is a problem of, given two unordered labeled trees P and T, finding all…”
Get full text

Homology search with binary and trinary scoring matrices by Smith, Scott F

“…Protein homology search can be accelerated with the use of bit-parallel algorithms in conjunction with constraints on the values contained in the scoring…”
Get more information

Parallelizing Exact and Approximate String Matching via Inclusive Scan on a GPU by Mitani, Yasuaki, Ino, Fumihiko, Hagihara, Kenichi

“…In this study, to substantially improve the runtimes of exact and approximate string matching algorithms, we propose a tribrid parallel method for bit-parallel…”
Get full text

A bit-parallel algorithm for searching multiple patterns with various lengths by Kusudo, Ko, Ino, Fumihiko, Hagihara, Kenichi

“…In this paper, we present an Advanced Vector Extensions (AVX) accelerated method for a bit-parallel algorithm that realizes fast string search for maximizing…”
Get full text

High-Performance Parallel Location-Aware Algorithms for Approximate String Matching on GPUs by Lin, Cheng-Hung, Huang, Chun-Cheng

“…Approximate string matching has been widely used in many applications, including deoxyribonucleic acid sequence searching, spell checking, text mining, and…”
Get full text

Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching by Hyyrö, Heikki

“…We propose a new variant of the bit-parallel NFA of Baeza-Yates and Navarro (BPD) for approximate string matching [R. Baeza-Yates, G. Navarro, Faster…”
Get full text

Bit-Parallel Witnesses and Their Applications to Approximate String Matching by Hyyrö, Heikki, Navarro, Gonzalo

Get full text

XLCS: A New Bit-Parallel Longest Common Subsequence Algorithm on Xeon Phi Clusters by Yin, Zekun, Zhang, Hao, Xu, Kai, Chan, Yuandong, Peng, Shaoliang, Liu, Weiguo, Schmidt, Bertil, Liu, Weiguo

“…Finding the longest common subsequence (LCS) of two strings is a classical problem in bioinformatics. A basic approach to solve this problem is based on…”
Get full text

Hierarchical Parallelism of Bit-Parallel Algorithm for Approximate String Matching on GPUs by Cheng Hung Lin, Guan Hong Wang, Chun Cheng Huang

“…Approximate string matching has been widely used in many areas, such as web searching, and deoxyribonucleic acid sequence matching, etc. Approximate string…”
Get full text