86,338 Hits in 5.5 sec

The Complexity of Pattern Matching for a Random String

Andrew Chi-Chih Yao
1979 SIAM journal on computing (Print)  
We study the average-case complexity of finding all occurrences of a given pattern CX in an input text string.  ...  Over an alphabet of q symbols, let c&n) be the minimum average number of characters that need to be exa-mined in a-random text string of length n .  ...  In this paper, we study the average-case complexity of pattern matching in the model of [4] .  ... 
doi:10.1137/0208029 fatcat:akr6zxr7pndmfbn2eigbsn57fa

Subject Index

2007 Journal of Discrete Algorithms  
Character sets of strings, 330; A linear time algorithm for the inver-Label Cover Approximation algorithms for the Label-Cover MAX and Red-Blue Set Cover problems, 55 Lattice animals On the complexity  ...  and straight line programs, 471 Stressing A Zero-Space algorithm for Negative Cost Cycle Detection in net- works, 408 String A simple fast hybrid pattern-matching algorithm, 682; Two-pattern strings  ... 
doi:10.1016/s1570-8667(07)00076-7 fatcat:wfqxglrznfb6do3wyittd5pfbi

Fast parameterized matching with q-grams

Leena Salmela, Jorma Tarhio
2008 Journal of Discrete Algorithms  
The problem of finding all parameterized matches of a pattern in a text has been studied in both one and two dimensions but the research has been centered on developing algorithms with good worst-case  ...  Two strings parameterize match if there is a bijection defined on the alphabet that transforms the first string character by character into the second string.  ...  We analyze the time complexities of the algorithms for random texts and moderately repetitive patterns.  ... 
doi:10.1016/j.jda.2007.11.001 fatcat:ex5t4qmstfanrpfzm4egbbf6ku

An iterative pattern mapping for parallel string matching architecture in intrusion detection systems

HyunJin Kim
2012 IEICE Electronics Express  
By mapping a set of patterns for a string matcher onto the other string matchers repeatedly, the required number of string matchers is reduced.  ...  Therefore, the proposed iterative pattern mapping minimizes the total memory requirement for parallel string matching architecture.  ...  Acknowledgement The present research was conducted by the research fund of Dankook University in 2012.  ... 
doi:10.1587/elex.9.985 fatcat:d6xq2rjb2reh3alpjdfkokuvla

A Pattern Partitioning Algorithm for Memory-Efficient Parallel String Matching in Deep Packet Inspection

HyunJin KIM, Hyejeong HONG, Dongmyoung BAEK, Sungho KANG
2010 IEICE transactions on communications  
This paper proposes a pattern partitioning algorithm that maps multiple target patterns onto homogeneous memory-based string matchers.  ...  pattern matching, and network monitoring  ...  When a target pattern is the suffix of other target patterns, more than one bit in FMVs are true. For example, when a pattern "abc" is matched, a pattern "bc" is matched, too.  ... 
doi:10.1587/transcom.e93.b.1612 fatcat:czjzsebe4rcstg4nhnyu2bhq2e

Privacy Preserving String Matching for Cloud Computing

Bruhadeshwar Bezawada, Alex X. Liu, Bargav Jayaraman, Ann L. Wang, Rui Li
2015 2015 IEEE 35th International Conference on Distributed Computing Systems  
We describe an efficient and accurate indexing structure, the PASStree, which can execute a string pattern query in logarithmic time complexity over a set of data items.  ...  While encryption of data provides sufficient protection, it is challenging to support rich querying functionality, such as string matching, over the encrypted data.  ...  Figure 1 . 1 PASStree Example Theorem 1 (Logarithmic Complexity): For a given query string p, the PASStree search algorithm finds all matching leaf nodes in a complexity of O(E logN )where N is the total  ... 
doi:10.1109/icdcs.2015.68 dblp:conf/icdcs/BezawadaLJWL15 fatcat:cxu5zdyjwzhcri3ij2x6ewxesa

Assessment of Computational Complexity and Methodologies of Pattern Matching Algorithms

Barkha Gupta
2021 IARJSET  
In complexity theory we need to analyse the program in terms of the efficiency of the program, lines of the code, finding out that the program is able to find out the correct answer or output, figuring  ...  Complexity Theory is a formal mathematical theory, in which we study computational problems and algorithms to solve those problems.  ...  ACKNOWLEDGEMENTS Author is grateful to Agriculture University, Jodhpur for encouraging writing in my field. XVI.  ... 
doi:10.17148/iarjset.2021.81109 fatcat:g6gquzlaqfhzxbl52n5jl2zgou

A Pattern Group Partitioning for Parallel String Matching using a Pattern Grouping Metric

HyunJin Kim, Sungho Kang
2010 IEEE Communications Letters  
Using a pattern grouping metric, the proposed pattern partitioning makes the average length of the mapped target patterns onto a string matcher approximately equal to the average length of total target  ...  This paper proposes an algorithm that partitions a set of target patterns into multiple subgroups for homogeneous string matchers.  ...  A Pattern Group Partitioning for Parallel String Matching using a Pattern Grouping Metric HyunJin Kim and Sungho Kang, Member,IEEE Abstract-Considering the increasing number of target patterns for the  ... 
doi:10.1109/lcomm.2010.080210.092347 fatcat:qaermiuwf5e6nml7dugrdf4ehi

The Sketching Complexity of Pattern Matching [chapter]

Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, Ravi Kumar
2004 Lecture Notes in Computer Science  
We address the problems of pattern matching and approximate pattern matching in the sketching model.  ...  We also prove a sketch size lower bound for approximate pattern matching, and show it is tight up to a logarithmic factor. and the pattern into a small sketch.  ...  whether for all i ∈ [n], HD(x[i, i + m − 1], y) ≥ εm, assuming that one of the two holds.  ... 
doi:10.1007/978-3-540-27821-4_24 fatcat:yykufllcr5e3hiqj555tvoevhu

A quantum algorithm for string matching

Pradeep Niroula, Yunseong Nam
2021 npj Quantum Information  
Here, we present an explicit, circuit-level implementation of a quantum pattern-matching algorithm that matches a search string (pattern) of length M inside a longer text of length N.  ...  Our algorithm has a time complexity of $$\tilde{O}(\sqrt{N})$$ O ̃ ( N ) , while the space complexity remains modest at O(N + M).  ...  ACKNOWLEDGEMENTS The authors would like to thank Jae Pak at IonQ for helpful conversations. P.N. acknowledges funding by the DoE ASCR Accelerated Research in Quantum Computing program (award No.  ... 
doi:10.1038/s41534-021-00369-3 fatcat:jnohhqvurvctdetswvn3nj3fka

Speed-up of Aho-Corasick pattern matching machines by rearranging states

T. Nishimura, S. Fukamachi, T. Shinohara
2001 Proceedings Eighth Symposium on String Processing and Information Retrieval  
This paper describes speed-up of string pattern matching by rearranging states in Aho-Corasick pattern matching machine, which is a kind of afinite automaton.  ...  We realized speed-up of string pattern matching using data compression. Although we obtain higher compression ratio using a finite state model, it doesn't lead speed-up of string pattern matching.  ...  From the results of experiments, the elapsed time of string pattern matching is reduced to 71% and 55% in case of a random text and a compressed text, respectively.  ... 
doi:10.1109/spire.2001.989753 dblp:conf/spire/NishimuraFS01 fatcat:cajeeuplung4tfse2oyvnor6pa

Order-Preserving Matching with Filtration [chapter]

Tamanna Chhabra, Jorma Tarhio
2014 Lecture Notes in Computer Science  
Any algorithm for exact string matching can be used as a filtering method. If the filtration algorithm is sublinear, the total method is sublinear on average.  ...  The problem of order-preserving matching has gained attention lately. The text and the pattern consist of numbers.  ...  We thank Hannu Peltola for his help.  ... 
doi:10.1007/978-3-319-07959-2_26 fatcat:d3dsc4lo45alxatv7uomrmzohq

The wide window string matching algorithm

Longtao He, Binxing Fang, Jie Sui
2005 Theoretical Computer Science  
Generally, current string matching algorithms make use of a window whose size is equal to pattern length.  ...  In this paper, we present a novel string matching algorithm named WW (for Wide Window) algorithm, which divides the text into n/m overlapping windows of size 2m−1.  ...  A new string matching algorithm (called WW for Wide Window) is proposed.  ... 
doi:10.1016/j.tcs.2004.12.002 fatcat:qhrjkgxtezghxfutju77uw6rpm

Page 5370 of Mathematical Reviews Vol. , Issue 94i [page]

1994 Mathematical Reviews  
This is a natural generalization of the string matching problem where only occurrences of the whole pattern are sought.  ...  Summary: “In the string prefix-matching problem one is interested in finding the longest prefix of a pattern string of length m that occurs starting at each position of a text string of length n.  ... 

On-line approximate string matching with bounded errors

Marcos Kiwi, Gonzalo Navarro, Claudio Telha
2011 Theoretical Computer Science  
Finally, we extend the proposed approach to the multiple approximate string matching setting, where the approximate occurrence of r patterns are simultaneously sought.  ...  n is the text size, m the pattern length, k the number of differences for edit distance, and σ the alphabet size.  ...  The second author was funded in part by Fondecyt Grant 1-080019, Chile. The third author gratefully acknowledges the support of CONICYT via Anillo en Redes ACT08.  ... 
doi:10.1016/j.tcs.2011.08.005 fatcat:z4v25wvs6nafrp6uasg75zw75a
« Previous Showing results 1 — 15 out of 86,338 results