Proceedings Article10.1109/ICCCCM.2013.6648922
An offensive algorithm for multi-pattern parameterized string matching
Swati Tevatia,Rajesh Prasad,Deepak Rai +2 more
- 31 Oct 2013
- pp 1-5
8
TL;DR: A new algorithm for multi-pattern parameterized string matching problem is proposed, an extension of quick multiple matching algorithm for exact string matching.
read more
Abstract: Finding a pattern P[0...m-1] in a large body of text T[0...n-1], m≤n, is called pattern matching. One of its variation is parameterized string matching. Two strings are said to parameterized match, if one can be transformed into other via some bijective mapping. The parameterized matching has important applications in software maintenance and plagiarism detection. In this paper, we propose a new algorithm for multi-pattern parameterized string matching problem. This is an extension of quick multiple matching algorithm for exact string matching. Experimental results show that the new algorithm is very fast in practice.
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
Fast Pattern Matching in Compressed Text using Wavelet Tree
TL;DR: This paper presents an efficient algorithm (WBTC_WT) for matching a pattern directly inside the compressed text and finds that this algorithm outperforms the existing algorithms in most of the cases.
10
Fast parameterized word matching on compressed text
Rama Garg,Rajesh Prasad,Suneeta Agarwal +2 more
- 01 Sep 2014
TL;DR: This paper focuses on the parameterized word matching on the compressed text, where both patterns and text are compressed before actual matching is performed, and uses efficient compression code: Word Based Tagged Code (WBTC).
7
An improved string-searching algorithm and its application in component security testing
TL;DR: Results show that the proposed improved string-searching algorithm finds strings in monitor logs 11.5% more efficiently than existing approaches.
5
An efficient approach towards compressed parameterized word matching using wavelet tree
TL;DR: An algorithm is presented that tries to optimize parameterized word matching on compressed domain that uses Word Based Tagged Code for compression and Wavelet tree for efficient searching and has better execution time.
5
Efficient multi-word parameterized matching on compressed text
Rajesh Prasad,Rama Garg +1 more
- 01 Oct 2014
TL;DR: An efficient algorithm for parameterized multi-word matching problem on the compressed text, where both patterns and text are compressed before actual matching is performed and pattern is treated as word.
3
References
Efficient string matching: an aid to bibliographic search
TL;DR: A simple, efficient algorithm to locate all occurrences of any of a finite number of keywords in a string of text that has been used to improve the speed of a library bibliographic search program by a factor of 5 to 10.
A very fast substring search algorithm
TL;DR: A substring search algorithm that is faster than the Boyer-Moore algorithm and does not depend on scanning the pattern string in any particular order is described.
444
A theory of parameterized pattern matching: algorithms and applications
Brenda S. Baker
- 01 Jun 1993
TL;DR: This paper develops a theory and algoritbrns for an application problem arising in software maintenance to track down duplication in a large software system, and gives efficient algorithms for constructing parametrized suffix trees and for reporting duplication over a threshold length.
192
Multipattern string matching with q-grams
TL;DR: Three algorithms for exact string matching of multiple patterns, which apply q-grams and bit parallelism are presented, which appeared to be substantially faster than earlier solutions for sets of 1,000--10,000 patterns.
Efficient parameterized string matching
Kimmo Fredriksson,Maxim Mozgovoy +1 more
TL;DR: Simple and practical algorithms for finding all pattern occurrences in sublinear time on average for parameterized string matching the pattern P matches a substring t of the text T if there exist a bijective mapping from the symbols of P to the symbol of t.
60