Search Results - "bit-parallel algorithm"

An exact bit-parallel algorithm for the maximum clique problem by San Segundo, Pablo, Rodríguez-Losada, Diego, Jiménez, Agustín

“…This paper presents a new exact maximum clique algorithm which improves the bounds obtained in state of the art approximate coloring by reordering the vertices…”
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 stable search throughput…”
Get full text

A BIT-PARALLEL ALGORITHM FOR SEQUENTIAL PATTERN MATCHING WITH WILDCARDS by Guo, Dan, Hong, Xiao-Li, Hu, Xue-Gang, Gao, Jun, Liu, Ying-Ling, Wu, Gong-Qing, Wu, Xindong

“…Pattern matching with both gap constraints and the one-off condition is a challenging topic, especially in bioinformatics, information retrieval, and…”
Get full text

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 algorithms such as the Shift-Or and Wu-Manber algorithms…”
Get full text

A Simple Streaming Bit-parallel Algorithm for Swap Pattern Matching by Blažej, Václav, Suchý, Ondřej, Valla, Tomáš

“…The pattern matching problem with swaps is to find all occurrences of a pattern in a text while allowing the pattern to swap adjacent symbols. The goal is to…”
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

“… In this paper, we propose a hierarchical parallelism approach to accelerate the bit-parallel algorithm on NVIDIA GPUs…”
Get full text

A Fast Bit-Parallel Algorithm for Computing the Subset Partial Order by Pritchard, P.

Get full text

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

“… Among the proposed algorithms, the bit-parallel algorithms are considered to be the best and highly efficient algorithms…”
Get full text

A New Exact Bit-Parallel Algorithm for SAT by San Segundo, P., Tapia, C., Puente, J., Rodriguez-Losada, D.

“…This paper presents two new exact general purpose bit-parallel algorithms (BB-SAT and BBP-SAT) for the Boolean satisfiability problem…”
Get full text

An alternative bit-parallel algorithm for parameterized string matching by Prasad, R., Agarwal, S.

“…In the parameterized string matching, a given pattern P is said to match with a substring t of the text T, if there exist a bijection from the symbols of P to…”
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

A modified word serial bit parallel algorithm for FPGA implementation of digital ionospheric radar

“…Digital signal processing (DSP) has become an integral part of wireless communication systems and equivalent traditional analog systems can be developed with…”
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

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

BitPAl: a bit-parallel, general integer-scoring sequence alignment algorithm by Loving, Joshua, Hernandez, Yozen, Benson, Gary

“…) and edit-distance problems, producing fast algorithms in practice. Results: We have developed BitPAl, a bit-parallel algorithm for general, integer-scoring global alignment…”
Get full text

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

Fast modular reduction and squaring in GF(2m) by Niehues, L. Boppre, Custódio, R., Panario, D.

“…We present an efficient bit-parallel algorithm for squaring in GF(2m) using polynomial basis…”
Get full text

Bit-parallel ( δ , γ ) -matching and suffix automata by Crochemore, Maxime, Iliopoulos, Costas S., Navarro, Gonzalo, Pinzon, Yoan J., Salinger, Alejandro

“… We first present an O ( m n log ( γ ) / w ) worst-case time and O ( n ) average-case time bit-parallel algorithm…”
Get full text

SLPal: Accelerating Long Sequence Alignment on Many-Core and Multi-Core Architectures by Xu, Xiaoming, Chan, Yuandong, Xu, Kai, Zhang, Jikai, Wang, Xiaoning, Yin, Zekun, Liu, Weiguo

“… The best known global alignment algorithm is Needleman-Wunsch, later, BitPAl, a bit parallel algorithm for general, integer…”
Get full text