Search Results - optimal speedup parallel string matching algorithm
-
1
Parallel Suffix–Prefix-Matching Algorithm and Applications
ISSN: 0097-5397, 1095-7111Published: Philadelphia, PA Society for Industrial and Applied Mathematics 01.10.1996Published in SIAM journal on computing (01.10.1996)“…Our main result in this paper is a parallel algorithm for suffix-prefix- ($s - p$-) matching that has optimal speedup on a concurrent-read/concurrent-write parallel random-access machine…”
Get full text
Journal Article -
2
A Parallel BMH String Matching Algorithm Based on OpenMP
Published: IEEE 01.08.2019Published in 2019 IEEE 21st International Conference on High Performance Computing and Communications; IEEE 17th International Conference on Smart City; IEEE 5th International Conference on Data Science and Systems (HPCC/SmartCity/DSS) (01.08.2019)“… 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
Conference Proceeding -
3
Parallel processing of E-Atheer algorithm using pthread paradigm
ISSN: 2502-4752, 2502-4760Published: 01.06.2023Published in Indonesian Journal of Electrical Engineering and Computer Science (01.06.2023)“… In this study, we implemented the parallel exact string matching algorithm termed as E-Atheer with multi-core processing…”
Get full text
Journal Article -
4
PARALLEL PROCESSING OUTCOMES OF E-ABDULRAZZAQ ALGORITHM USING MULTI-CORE TECHNIQUE
ISSN: 2313-190X, 2520-4912Published: University of Information Technology and Communications 24.12.2022Published in Iraqi journal for computers and informatics (Online) (24.12.2022)“… is the parallelization for exact string matching algorithms. In this study, the E-Abdulrazzaq string matching algorithm is chosen to be executed with the multi-core environment utilizing the OpenMP paradigm which can be utilized to decrease the execution time…”
Get full text
Journal Article -
5
Towards optimal packed string matching
ISSN: 0304-3975, 1879-2294Published: Elsevier B.V 13.03.2014Published in Theoretical computer science (13.03.2014)“…–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
Journal Article -
6
Bit-parallel sequence-to-graph alignment
ISSN: 1367-4803, 1367-4811, 1460-2059, 1367-4811Published: England Oxford University Press 01.10.2019Published in Bioinformatics (01.10.2019)“… Results We generalize two linear sequence-to-sequence algorithms to graphs: the Shift-And algorithm for exact matching and Myers…”
Get full text
Journal Article -
7
The Approximate String Matching on the Hierarchical Memory Machine, with Performance Evaluation
Published: IEEE 01.09.2013Published in 2013 IEEE 7th International Symposium on Embedded Multicore Socs (01.09.2013)“… The main contribution of this paper is to show an optimal parallel algorithm for the approximate string matching on the HMM and to implement it on a CUDA-enabled GPU…”
Get full text
Conference Proceeding -
8
Simple Optimal Parallel Multiple Pattern Matching
ISSN: 0196-6774, 1090-2678Published: San Diego, CA Elsevier Inc 01.01.2000Published in Journal of algorithms (01.01.2000)“…In this paper, we present a simple algorithm for solving the multipattern matching problem, with optimal speedup…”
Get full text
Journal Article -
9
Unified VLSI systolic array design for LZ data compression
ISSN: 1063-8210, 1557-9999Published: Piscataway, NJ IEEE 01.08.2001Published in IEEE transactions on very large scale integration (VLSI) systems (01.08.2001)“… Also, multiple chips (linear arrays) can be connected in parallel to implement the parallel array structure and provide a proportional speedup…”
Get full text
Journal Article -
10
Deterministic Sampling–A New Technique for Fast Pattern Matching
ISSN: 0097-5397, 1095-7111Published: Philadelphia, PA Society for Industrial and Applied Mathematics 01.02.1991Published in SIAM journal on computing (01.02.1991)“… Consider the string matching problem. Given the pattern, a sample of its positions is carefully selected whose size is at most…”
Get full text
Journal Article -
11
Cost-optimal parallel algorithms for finitely inductive sequences
ISBN: 0818632305, 9780818632303Published: IEEE 1993Published in Hawaii International Conference on System Sciences, 1993: Proceedings (1993)“…), parallel random access machine (PRAM) model. Each of the algorithms achieves cost-optimal speedup under certain conditions as detailed.< >…”
Get full text
Conference Proceeding -
12
Parallel Approximate Multi-Pattern Matching on Heterogeneous Cluster Systems
ISBN: 9780769534435, 0769534430ISSN: 2379-5352Published: IEEE 01.12.2008Published in 2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies (01.12.2008)“… Secondly, based on divisible load principle, a linear programming model for the optimal text distribution strategy is created and a parallel approximate multi-pattern matching algorithm allowing one…”
Get full text
Conference Proceeding

