Výsledky vyhľadávania - parallel string-matching algorithm
-
1
An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm
ISSN: 0097-5397, 1095-7111Vydavateľské údaje: Philadelphia, PA Society for Industrial and Applied Mathematics 01.12.1990Vydané v SIAM journal on computing (01.12.1990)“…An optimal $O(\log \log n)$ time parallel algorithm for string matching on CROW-PRAM is presented…”
Získať plný text
Journal Article -
2
Perfect Hashing Based Parallel Algorithms for Multiple String Matching on Graphic Processing Units
ISSN: 1045-9219, 1558-2183Vydavateľské údaje: New York IEEE 01.09.2017Vydané v IEEE transactions on parallel and distributed systems (01.09.2017)“…Multiple string matching has a wide range of applications such as network intrusion detection systems, spam filters, information retrieval systems, and bioinformatic…”
Získať plný text
Journal Article -
3
A parallel approximate string matching under Levenshtein distance on graphics processing units using warp-shuffle operations
ISSN: 1932-6203, 1932-6203Vydavateľské údaje: United States Public Library of Science 10.10.2017Vydané v PloS one (10.10.2017)“… This paper proposes an efficient memory-access algorithm for parallel approximate string matching with k-differences on Graphics Processing Units (GPUs…”
Získať plný text
Journal Article -
4
Derivation of a parallel string matching algorithm
ISSN: 0020-0190, 1872-6119Vydavateľské údaje: Amsterdam Elsevier B.V 16.03.2003Vydané v Information processing letters (16.03.2003)“…We derive an efficient parallel algorithm to find all occurrences of a pattern string in a subject string in O(log n…”
Získať plný text
Journal Article -
5
Parallel Hybrid String Matching Algorithm Using CUDA API Function
Vydavateľské údaje: IEEE 15.09.2021Vydané v 2021 International Conference on Computing and Communications Applications and Technologies (I3CAT) (15.09.2021)“…Due to the fast growth of information recently, traditional string matching algorithms face a significant speed challenge…”
Získať plný text
Konferenčný príspevok.. -
6
A Parallel BMH String Matching Algorithm Based on OpenMP
“… This paper proposed a parallel BMH string matching algorithm based on OpenMP. The parallelism of the BMH algorithm is first identified by theoretical analysis…”Vydavateľské údaje: IEEE 01.08.2019
Získať plný text
Konferenčný príspevok.. -
7
Bit-parallel approximate string matching algorithms with transposition
ISSN: 1570-8667, 1570-8675Vydavateľské údaje: Elsevier B.V 01.06.2005Vydané v Journal of discrete algorithms (Amsterdam, Netherlands) (01.06.2005)“…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…”
Získať plný text
Journal Article -
8
COMPARATIVE ANALYSIS OF BIT-PARALLEL STRING PATTERN MATCHING ALGORITHMS FOR BIOLOGICAL SEQUENCES
ISSN: 2620-1607, 2620-1747Vydavateľské údaje: Regional Association for Security and crisis management, Belgrade, Serbia 01.04.2023Vydané v Operational Research in Engineering Sciences: Theory and Applications (01.04.2023)“… The use of recently developed bit parallel string matching algorithms approaches helps in improving the efficiency of the other string pattern matching algorithms…”
Získať plný text
Journal Article -
9
Improving practical exact string matching
ISSN: 0020-0190, 1872-6119Vydavateľské údaje: Amsterdam Elsevier B.V 16.01.2010Vydané v Information processing letters (16.01.2010)“…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…”
Získať plný text
Journal Article -
10
O(1)-time parallel string-matching algorithm with VLDCs
ISSN: 0167-8655, 1872-7344Vydavateľské údaje: Amsterdam Elsevier B.V 01.05.1996Vydané v Pattern recognition letters (01.05.1996)“…Given a text of length n and a pattern of length m over a finite alphabet Σ, we consider the string matching (SM…”
Získať plný text
Journal Article -
11
High-Performance Parallel Location-Aware Algorithms for Approximate String Matching on GPUs
ISSN: 1521-9097Vydavateľské údaje: IEEE 01.12.2015Vydané v Proceedings - International Conference on Parallel and Distributed Systems (01.12.2015)“…Approximate string matching has been widely used in many applications, including deoxyribonucleic acid sequence searching, spell checking, text mining, and spam filters…”
Získať plný text
Konferenčný príspevok.. Journal Article -
12
CUSMART: effective parallelization of string matching algorithms using GPGPU accelerators
ISSN: 2095-9184, 2095-9230Vydavateľské údaje: Hangzhou Zhejiang University Press 01.06.2025Vydané v Frontiers of information technology & electronic engineering (01.06.2025)“…This study presents a parallel version of the string matching algorithms research tool (SMART…”
Získať plný text
Journal Article -
13
Parallel DNA Sequencing using Exact String-Matching Algorithms for Multiple Patterns
ISSN: 2643-1858Vydavateľské údaje: IEEE 02.09.2025Vydané v International Conference in Information, Communication and Automation Technologies (Online) (02.09.2025)“…String matching algorithms are used to find specific patterns within a larger file or sequence…”
Získať plný text
Konferenčný príspevok.. -
14
Improved bit-parallel string matching algorithm overcoming computer word size limitation
ISBN: 1457706946, 9781457706943Vydavateľské údaje: IEEE 01.03.2012Vydané v 2012 1st International Conference on Recent Advances in Information Technology (01.03.2012)“…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…”
Získať plný text
Konferenčný príspevok.. -
15
Parallel DNA sequencing with exact and approximate string-matching algorithms
ISSN: 2643-1858Vydavateľské údaje: IEEE 11.06.2023Vydané v International Conference in Information, Communication and Automation Technologies (Online) (11.06.2023)“…String-matching algorithms are concerned with lo-cating specific patterns within larger strings or text files…”
Získať plný text
Konferenčný príspevok.. -
16
Parallel Algorithm for Approximate String Matching with K Differences
Vydavateľské údaje: IEEE 01.07.2013Vydané v 2013 IEEE Eighth International Conference on Networking, Architecture and Storage (01.07.2013)“… Data dependency exists in the traditional sequential algorithm. Therefore, it is hard to design a parallel algorithm for approximate string matching with k differences…”
Získať plný text
Konferenčný príspevok.. -
17
Hardware-Algorithm Codesign for Fast and Energy Efficient Approximate String Matching on FPGA for Computational Biology
ISSN: 2694-0604, 2694-0604Vydavateľské údaje: IEEE 01.01.2022Vydané v 2022 44th Annual International Conference of the IEEE Engineering in Medicine & Biology Society (EMBC) (01.01.2022)“…Myers bit-vector algorithm for approximate string matching (ASM) is a dynamic programming based approach that takes advantage of bit-parallel operations…”
Získať plný text
Konferenčný príspevok.. Journal Article -
18
Efficient parallel hardware algorithms for string matching
ISSN: 0141-9331, 1872-9436Vydavateľské údaje: Elsevier B.V 01.10.1999Vydané v Microprocessors and microsystems (01.10.1999)“…This paper presents efficient parallel hardware algorithms for string matching. Two subproblems known as the exact matching and the k-mismatches problems are covered…”
Získať plný text
Journal Article -
19
Hierarchical Parallelism of Bit-Parallel Algorithm for Approximate String Matching on GPUs
Vydavateľské údaje: IEEE 01.07.2014Vydané v 2014 IEEE Symposium on Computer Applications and Communications (01.07.2014)“…Approximate string matching has been widely used in many areas, such as web searching, and deoxyribonucleic acid sequence matching, etc…”
Získať plný text
Konferenčný príspevok.. -
20
Towards optimal packed string matching
ISSN: 0304-3975, 1879-2294Vydavateľské údaje: Elsevier B.V 13.03.2014Vydané v 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 α…”
Získať plný text
Journal Article

