A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
Filters
Introducing efficient parallelism into approximate string matching and a new serial algorithm
1986
Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86
Preserved Fulltext
Given a text of length n, a pattern of length m and an integer k, we present parallel and serial algorithms for finding all occurrences of the pattern in the text with at most k differences. ...
The serial algorithm follows also this new approach for handling the text. It runs in O(kn) time for alphabet whose size is fixed. For general input the algorithm requires O (n (k + log n )) time. ...
There are a few notable algorithms for the string matching problem: linear time serial algorithms - , , , (a randomized algorithm) and [V-85b] , parallel algorithms [G-84] and [V-85b] . ...
doi:10.1145/12130.12152
dblp:conf/stoc/LandauV86
fatcat:hjn7yfok5ve75dkorw4mf3yfve
Pattern matching of signature-based IDS using Myers algorithm under MapReduce framework
2017
EURASIP Journal on Information Security
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This research intends to accelerate the pattern matching operation through parallelizing a matching algorithm on a multi-core CPU. ...
In this paper, we parallelize a bit-vector algorithm, Myers algorithm, on a multi-core CPU under the MapReduce framework. ...
Acknowledgements We would like to acknowledge the efforts of Yaser Jararweh and the valuable feedback of the reviewers.
Availability of data and material Not applicable. ...
doi:10.1186/s13635-017-0062-7
fatcat:nmpetehk2jgyvdmkwcshhy4b2u
Querying and Mining Strings Made Easy
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Therefore, we propose a scalable and efficient data structure that allows StarQL implementations to handle large sets of strings and utilize large computing infrastructures. ...
This paper presents StarQL, a generic and declarative query language for strings. ...
This paper proposed StarQL, a declarative query language for strings; and StarIN, a scalable and efficient data structure. ...
doi:10.1007/978-3-319-69179-4_1
fatcat:7mwy47qmhzbkbd3m2mgv2qkgmm
StarDB
2015
Proceedings of the VLDB Endowment
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
It uses a comprehensive set of parallel string operations and provides a declarative query language to solve complex queries. ...
Existing techniques are not flexible and cannot efficiently handle complex queries or large datasets. In this paper, we demonstrate StarDB, a distributed database system for analytics on strings. ...
(ii ) We use efficient and self-tuned parallel algorithms to utilize resources and speedup computation. ...
doi:10.14778/2824032.2824082
fatcat:xyf7qe7smrgaxnbd646hanldim
String Matching on a Multicore GPU Using CUDA
2009
2009 13th Panhellenic Conference on Informatics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
This paper presents experimental results on the parallel processing for some well known on-line string matching algorithms using one such GPU abstraction API, the Compute Unified Device Architecture (CUDA ...
GPGPU made possible to exploit the processing power and the memory bandwidth of the GPUs with the use of APIs that hide the GPU hardware from programmers. ...
including approximate and two dimensional string matching. ...
doi:10.1109/pci.2009.47
dblp:conf/pci/KouzinopoulosM09
fatcat:shoq453rvbbd3gi7d5oztpirbi
Parallel String Matching Problems with Computing Models An Analysis of the Most Recent Studies
2013
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We focus on current developments of parallel string matching, computing models, and the central ideas of the algorithms and their complexities. ...
We survey the current techniques to handle with the problem of parallel string matching with computing models. ...
., [41] proposes a memory-efficient parallel string matching scheme. ...
doi:10.5120/13321-0738
fatcat:ca3hjbzpxrc2rgjn7tjmhca4ni
Page 2560 of Mathematical Reviews Vol. , Issue 98D
[page]
1998
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Our algorithm is based on the notion of failure function and mainly consists in efficiently constructing a new deterministic automaton. ...
A g-gram index of the text is used in many approximate pattern matching algorithms. All earlier g-gram indexes have at least linear size. ...
Fast parallel and serial multidimensional approximate array matching
1991
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Amir, A. and GM. Landau, Fast parallel and serial multidimensional approxim i&e array matching, Theoretical Computer Science 81 ( 1991) 97-l 15. ...
Our serial algorithm runs in time O( nt'( dk + k')) and the parallel algorithm run= in time 0( d( "log n -t k) + k') using nd processors. ...
, Dennis Shasha, Uzi Wishkin and Moti Yung for helpful discussions concerning the issues of this paper, and Aliza Amir and Bill Gasarch for proofreading. ...
doi:10.1016/0304-3975(91)90318-v
fatcat:wfsjmagn6fbvbitdqtibbarsem
A Parallel High Speed Lossless Data Compression Algorithm in Large-Scale Wireless Sensor Network
2015
International Journal of Distributed Sensor Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The core idea of PMLZSS algorithm is parallel matrix matching. ...
PMLZSS algorithm divides the data compression files into multiple compressed dictionary window strings and prereading window strings along the vertical and horizontal axes of the matrices, respectively ...
Basic Serial BF String Matching Algorithm. ...
doi:10.1155/2015/795353
fatcat:zpigahnu6jg5xfeqxtmjybpu64
Page 2081 of Mathematical Reviews Vol. , Issue 2003C
[page]
2003
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Several methods were designed for approximate string matching that simulate non- deterministic finite automata (NFA) constructed for this problem. ...
This paper presents reduced NFAs for approximate string match- ing usable when we are interested only in occurrences having edit distance less than or equal to a given integer, but we are not in- terested ...
Parallel String Matching Algorithm Using Grid
2012
International Journal of Distributed and Parallel systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Implementing computing intensive applications such as string matching problem on grid is inevitable. In this paper we present a new method for exact string matching based on grid computing. ...
This improves the executing time of the string matching algorithms on grid. The simulation results show significant improvement in executing time and speed up. ...
Acknowledgements We sincerely thank our colleagues in the Department of Computer Science and Engineering for their advice and helpful discussions. ...
doi:10.5121/ijdps.2012.3303
fatcat:c7bt2io2g5dltahsedrboefxwm
Exact String Matching Algorithms: Survey, Issues, and Future Research Directions
2019
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Understanding different string matching approaches (such as exact string matching and approximate string matching algorithms), integrating several algorithms, and modifying algorithms to address related ...
with a core focus on exact string matching algorithms. ...
APPROXIMATE STRING MATCHING ALGORITHMS Approximate string matching algorithm finds a substring that is close to a given pattern string. ...
doi:10.1109/access.2019.2914071
fatcat:2bkgo6vkjjd63nl2yavplt6gw4
Exploiting parallelism in pattern matching: an information retrieval application
1991
ACM Transactions on Information Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
We also propose B new parallel VLSI pnttern~matching algorithm called the Data Parallel Pattern Matching (DPPM) algorithm, which serially broadcasts and compares the pattern to a block of data in parallel ...
We propose a document-searching architecture baaed on high-speed hardware pattern matching to increase the throughput of an information retrieval system. ...
Sudhir Aggarwal. and Bill Mamfblf or their support in this project. ...
doi:10.1145/103731.103734
fatcat:x6ws4eqoebgi7lmqtz5ym2qbnq
Scalable Similarity Joins of Tokenized Strings
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Comparing the tokenized-string features of a large number of accounts requires an intuitive tokenized-string distance that can detect subtle edits introduced by an adversary, and a very scalable algorithm ...
We carefully engineer optimizations and approximations that dramatically improve the efficiency of TSJ. ...
These multi-identity attacks can be classified roughly into serial and parallel attacks, or combinations of both 2 . ...
arXiv:1903.09238v1
fatcat:jogiioacwfbx7azgxtqq4blnwa
Distributed Algorithm for Parallel Edit Distance Computation
2020
Computing and informatics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
In this work, a distributed algorithm is presented for parallel edit distance computation. The proposed algorithm is both time and space efficient. ...
It is evaluated on a hybrid setup of distributed and shared memory systems. Results suggest that the proposed algorithm achieves significant performance gain over the existing parallel approach. ...
A bit parallel algorithm for the problem of approximate string matching [15] is presented in [16] . This algorithm is serial and depends upon the word size of machine. ...
doi:10.31577/cai_2020_4_757
fatcat:kil5sq5wnbc4lapauuin56kfjm
« Previous
Showing results 1 — 15 out of 8,187 results