Parallel String Matching Problems with Computing Models - An Analysis of the Most Recent Studies
TL;DR: This work surveys the current techniques to handle with the problem of parallel string matching with computing models, and presents the performance of the different algorithms and their effectiveness.
read more
Abstract: e survey the current techniques to handle with the problem of parallel string matching with computing models. This is becoming a more and more relevant issue for many fast growing areas such as information retrieval and computational biology. We focus on current developments of parallel string matching, computing models, and the central ideas of the algorithms and their complexities. We present the performance of the different algorithms and their effectiveness. Finally this analysis helps the researchers to develop the better technique.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Parallel string matching for image matching with prime method
Chinta Someswara Rao
- 01 Jan 2014
TL;DR: A method for image search based on the prime method, which uses a sliding window approach, in this approach each sub image clipped by narrow window is converted to code vector and these code vectors are used in image matching.
References
A bridging model for parallel computation
TL;DR: The bulk-synchronous parallel (BSP) model is introduced as a candidate for this role, and results quantifying its efficiency both in implementing high-level language features and algorithms, as well as in being implemented in hardware.
4.1K
LDAHash: Improved Matching with Smaller Descriptors
TL;DR: This work reduces the size of the descriptors by representing them as short binary strings and learn descriptor invariance from examples, and shows extensive experimental validation, demonstrating the advantage of the proposed approach.
Deep packet inspection using parallel Bloom filters
Sarang Dharmapurikar,Praveen Krishnamurthy,Todd Sproull,John W. Lockwood +3 more
- 15 Sep 2003
TL;DR: This work describes a technique based on Bloom filters for detecting predefined signatures (a string of bytes) in the packet payload and uses hardware Bloom filters to isolate all packets that potentially containpredefined signatures.
365
The Design of Special-Purpose VLSI Chips
TL;DR: Structured VLSI design proceeds from algorithm to logic cell to cell array to special-purpose chip, yielding cheap, powerful, and modular hardware that will permanently alter the systems landscape of the 80's.
263
A Memory-Efficient Bit-Split Parallel String Matching Using Pattern Dividing for Intrusion Detection Systems
TL;DR: In this article, a memory-efficient parallel string matching scheme is proposed for low-cost hardware-based intrusion detection systems, where long target patterns are divided into sub-patterns with a fixed length.
114
Related Papers (5)
Ali Pinar,Bruce Hendrickson +1 more
- 01 Apr 2005
John H. Reif
- 01 Sep 1993
Ali Pinar,Michael T. Heath,Bruce Hendrickson +2 more
- 01 Jan 2001