Search Results - parallel string-matching algorithm

An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm by Breslauer, Dany, Galil, Zvi

“…An optimal $O(\log \log n)$ time parallel algorithm for string matching on CROW-PRAM is presented…”
Get full text

Perfect Hashing Based Parallel Algorithms for Multiple String Matching on Graphic Processing Units by Lin, Cheng-Hung, Li, Jin-Cheng, Liu, Chen-Hsiung, Chang, Shih-Chieh

“…Multiple string matching has a wide range of applications such as network intrusion detection systems, spam filters, information retrieval systems, and bioinformatic…”
Get full text

A parallel approximate string matching under Levenshtein distance on graphics processing units using warp-shuffle operations by Ho, ThienLuan, Oh, Seung-Rohk, Kim, HyunJin

“… This paper proposes an efficient memory-access algorithm for parallel approximate string matching with k-differences on Graphics Processing Units (GPUs…”
Get full text

Derivation of a parallel string matching algorithm by Misra, Jayadev

“…We derive an efficient parallel algorithm to find all occurrences of a pattern string in a subject string in O(log n…”
Get full text

Parallel Hybrid String Matching Algorithm Using CUDA API Function by Al-Dabbagh, Sinan Sameer Mahmood, Abdal, Yasir M.

“…Due to the fast growth of information recently, traditional string matching algorithms face a significant speed challenge…”
Get full text

A Parallel BMH String Matching Algorithm Based on OpenMP by Qi, Xiao, Liu, Bin, Li, Yuancheng, Du, Yanning, Li, Yuxiang, Niu, Dangdang

“… This paper proposed a parallel BMH string matching algorithm based on OpenMP. The parallelism of the BMH algorithm is first identified by theoretical analysis…”
Get full text

Bit-parallel approximate string matching algorithms with transposition by Hyyrö, Heikki

“…Using bit-parallelism has resulted in fast and practical algorithms for approximate string matching under Levenshtein edit distance, which permits a single edit operation to insert, delete or substitute a character…”
Get full text

COMPARATIVE ANALYSIS OF BIT-PARALLEL STRING PATTERN MATCHING ALGORITHMS FOR BIOLOGICAL SEQUENCES by Muhammad Yusuf Muhammad, Mathias Fonkam, Salu George Thandekatu, Sandip Rakshit, Rao Narasimha Vajjhala

“… The use of recently developed bit parallel string matching algorithms approaches helps in improving the efficiency of the other string pattern matching algorithms…”
Get full text

Improving practical exact string matching by Ďurian, Branislav, Holub, Jan, Peltola, Hannu, Tarhio, Jorma

“…We present improved variations of the BNDM algorithm for exact string matching. At each alignment our bit-parallel algorithms process a q-gram before testing the state variable…”
Get full text

O(1)-time parallel string-matching algorithm with VLDCs by Chung, Kuo-Liang

“…Given a text of length n and a pattern of length m over a finite alphabet Σ, we consider the string matching (SM…”
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 spam filters…”
Get full text

CUSMART: effective parallelization of string matching algorithms using GPGPU accelerators by Ozsoy, Adnan, Nazli, Mengu, Cankur, Onur, Sahin, Cagri

“…This study presents a parallel version of the string matching algorithms research tool (SMART…”
Get full text

Parallel DNA Sequencing using Exact String-Matching Algorithms for Multiple Patterns by Terzic, Dzenana, Pita, Naida, Becirspahic, Nejla, Muhic, Dzenis

“…String matching algorithms are used to find specific patterns within a larger file or sequence…”
Get full text

Improved bit-parallel string matching algorithm overcoming computer word size limitation by Sharma, A. K., Singh, A., Agarwal, S., Pandey, K. L., Prasad, R.

“…Algorithms that uses bit-wise operations are known as bit-parallel algorithms. Technique of bit-parallelism has been very useful in string matching area since the introduction of the Shift-Or algorithm…”
Get full text

Parallel DNA sequencing with exact and approximate string-matching algorithms by Begovic, A., Kaleta, S., Panjeta, E., Polutan, E.

“…String-matching algorithms are concerned with lo-cating specific patterns within larger strings or text files…”
Get full text

Parallel Algorithm for Approximate String Matching with K Differences by Longjiang Guo, Shufang Du, Meirui Ren, Yu Liu, Jinbao Li, Jing He, Ning Tian, Keqin Li

“… Data dependency exists in the traditional sequential algorithm. Therefore, it is hard to design a parallel algorithm for approximate string matching with k differences…”
Get full text

Hardware-Algorithm Codesign for Fast and Energy Efficient Approximate String Matching on FPGA for Computational Biology by Gudur, Venkateshwarlu Yellaswamy, Maheshwari, Sidharth, Bhardwaj, Swati, Acharyya, Amit, Shafik, Rishad

“…Myers bit-vector algorithm for approximate string matching (ASM) is a dynamic programming based approach that takes advantage of bit-parallel operations…”
Get full text

Efficient parallel hardware algorithms for string matching by Park, J.H., George, K.M.

“…This paper presents efficient parallel hardware algorithms for string matching. Two subproblems known as the exact matching and the k-mismatches problems are covered…”
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…”
Get full text

Towards optimal packed string matching by Ben-Kiki, Oren, Bille, Philip, Breslauer, Dany, Ga̧sieniec, Leszek, Grossi, Roberto, Weimann, Oren

“…–Perrin constant-space O(n)-time string-matching algorithm to run in optimal O(n/α) time and even in real-time, achieving a factor α…”
Get full text