46 Hits in 2.5 sec

Automaton-Based Sublinear Keyword Pattern Matching [chapter]

Loek Cleophas, Bruce W. Watson, Gerard Zwaan
2004 Lecture Notes in Computer Science  
• Update output variable after instead of in inner loop Automaton-based Sublinear Keyword Pattern Matching SPIRE 2004, Padova, Italy, October 5 -8 2004  ...  (P R ) R Automaton-based Sublinear Keyword Pattern Matching SPIRE 2004, Padova, Italy, October 5 - 8 2004 Concluding Remarks • Derived automaton-based SKPM algorithm skeleton • Automaton-based  ...  DAWG Matching, (Set) Backward Oracle Matching Automaton-based Sublinear Keyword Pattern Matching SPIRE 2004, Padova, Italy, October 5 - 8 2004 Towards a Sublinear KPM Skeleton -I • I.e. using  ... 
doi:10.1007/978-3-540-30213-1_3 fatcat:nsqzud4zrbfxngo67d3y5bpbei

A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms

Loek Cleophas, Bruce W. Watson, Gerard Zwaan
2010 Science of Computer Programming  
A new taxonomy of sublinear (multiple) keyword pattern matching algorithms is presented.  ...  In particular, we show how suffix-based (Commentz-Walter like), factor-and factor-oracle-based sublinear keyword pattern matching algorithms can be seen as instantiations of a general sublinear algorithm  ...  factor-and factor-oracle-based sublinear algorithms as well, there are still some keyword pattern matching algorithms that we have not considered.  ... 
doi:10.1016/j.scico.2010.04.012 fatcat:7tzjiwynjzfv7pr7c72j7p6bki

Searching Massive Data Streams Using Multipattern Regular Expressions [chapter]

Jon Stewart, Joel Uckelman
2011 IFIP Advances in Information and Communication Technology  
The tool directly simulates a nondeterministic finite automaton, and incorporates a number of practical optimizations related to searching with large pattern sets.  ...  Introduction The regular-expression-based keyword search tool grep has several important applications in digital forensics.  ...  For example, Watson [17] describes a sublinear multipattern matching algorithm that combines a Commentz-Walter fixed-string search for prefixes of matches with full automaton evaluation for the complete  ... 
doi:10.1007/978-3-642-24212-0_4 fatcat:oguw22g2a5fltocfm5w7u4mvrm

New and faster filters for multiple approximate string matching

Ricardo Baeza-Yates, Gonzalo Navarro
2002 Random structures & algorithms (Print)  
In Section 3 we present \automaton superimposition", which extends a bit-parallel simulation of a nondeterministic nite automaton (NFA) 6].  ...  We present three new algorithms for on-line multiple string matching allowing errors. These are extensions of previous algorithms that search for a single pattern.  ...  Pattern Partitioning This technique is based on Lemma 1 of Section 2.1.  ... 
doi:10.1002/rsa.10014 fatcat:rrpurj57lzdrnhdwczwwwxllzq

Hardware software co-design of the Aho-Corasick algorithm: Scalable for protein identification? [article]

S.M. Vidanagamachchi, S.D. Dewasurendra, R.G. Ragel
2014 arXiv   pre-print
Pattern matching is commonly required in many application areas and bioinformatics is a major area of interest that requires both exact and approximate pattern matching.  ...  This paper presents a hardware software co-design of Aho-Corasick algorithm in Nios II soft-processor and a study on its scalability for a pattern matching application.  ...  virus scanning [6] Packet classification [8] Pattern matching hardware [7] Peptide identification (Our system) Hardware Accelerate malware pattern search, use Bloom filter based accelerator  ... 
arXiv:1403.1317v1 fatcat:upl5uzpanvbxdhgdok4aesi5fu

A taxonomy of sublinear multiple keyword pattern matching algorithms

B.W. Watson, G. Zwaan
1996 Science of Computer Programming  
This article presents a taxonomy of sublinear keyword pattern matching algorithms related to the Boyer-Moore algorithm [3] and the Commentz-Walter algorithm [5, 6] .  ...  The taxonomy includes, amongst others, the multiple keyword generalization of the single keyword Boyer-Moore algorithm and an algorithm by Fan and Su [9. IO].  ...  OPTFig. 1 . 1 Taxonomy graph of sublinear multiple keyword pattern matching algorithms.  ... 
doi:10.1016/0167-6423(96)00008-1 fatcat:w7yc62bglzaolja5hdiullgl44

A fast scalable automaton-matching accelerator for embedded content processors

Kuo-Kun Tseng, Yuan-Cheng Lai, Ying-Dar Lin, Tsern-Huei Lee
2009 ACM Transactions on Embedded Computing Systems  
Although automaton matching algorithms are robust with deterministic matching time, there is still plenty of room for improving their average-case performance.  ...  FSAM employs novel prehash and root-index techniques to accelerate the matching for the nonroot states and the root state, respectively, in automation based hardware.  ...  Thus, the automaton-based algorithm was selected as a base to develop our new approaches.  ... 
doi:10.1145/1509288.1509291 fatcat:uwcgfhhsufgcjimm5mhvjxpbcq

An Information Retrieval Algorithm for Accounting Internal Audit Using Multi-Pattern Similarity Matching

Chunguang Ma, Hongjun Bei, Guihua Chen, Jianhui Gao, Muhammad Babar
2022 Mobile Information Systems  
The state driver is driven by the characters of the string to be matched in turn, and each finite automaton is driven by the state driver to achieve similar multimodal matching with mixed English and Chinese  ...  It also analyzed the shortcomings of existing multi-mode similarity systems and proposed a multi-mode algorithm based on the trail hash trie matching machine suitable for mixed Chinese and English environments  ...  For example, a fully hashed trie matching machine based on the set of pattern strings {Company, Shareholder, Employee} is shown in Figure 2 .  ... 
doi:10.1155/2022/6521905 fatcat:yobjtsv7ezdynefuclagdos5cy

Dynamic 2D Dictionary Matching in Small Space [article]

Shoshana Marcus, Dina Sokol
2013 arXiv   pre-print
The dictionary matching problem preprocesses a set of patterns and finds all occurrences of each of the patterns in a text when it is provided.  ...  This article presents the first algorithm that performs dynamic dictionary matching on two-dimensional data within small space. The time complexity of our algorithm is almost linear.  ...  The Bird / Baker algorithm readily extends to dictionary matching by replacing the 1D single pattern matching mechanism, a Knuth-Morris-Pratt automaton, with 1D dictionary matching, an Aho-Corasick automaton  ... 
arXiv:1302.0072v1 fatcat:tj4mdp3e6jd6dhxns62vatl6oe

From searching text to querying XML streams

Dan Suciu
2004 Journal of Discrete Algorithms  
At a finer level, it is related to the tree pattern matching problem.  ...  New XML stream processing applications, such as content-based routing or selective dissemination of information, require thousands or millions of XPath expressions to be evaluated simultaneously on the  ...  Sublinear computations. The Boyer-Moore algorithm matches a string in a text in sublinear time. Is it possible to match a set of XPath expressions on an XML document in sublinear time?  ... 
doi:10.1016/s1570-8667(03)00063-7 fatcat:jdf7cnduxbb5zlc32zztfgcqzi

Exact String Matching Algorithms: Survey, Issues, and Future Research Directions

Saqib Hakak, Amirrudin Kamsin, Palaiahnakote Shivakumara, Gulshan Amin Gilkar, Wazir Zada Khan, Muhammad Imran
2019 IEEE Access  
INDEX TERMS String matching, Boyer-Moore, Rabin-Karp, Knuth-Morris-Pratt, exact string matching, pattern matching, pattern recognition, pattern analysis. 69614 2169-3536  ...  This paper presents a survey on single-pattern exact string matching algorithms.  ...  The graph is plotted by using various keywords, such as the application of string matching algorithms, exact matching algorithms, and other related keywords.  ... 
doi:10.1109/access.2019.2914071 fatcat:2bkgo6vkjjd63nl2yavplt6gw4

Fast average-case pattern matching by multiplexing sparse tables

Russell W. Quong
1992 Theoretical Computer Science  
., Fast average-case pattern matching by multiplexing sparse tables, Theoretical Computer Science 92 (1992) 1655179. Pattern matching consists of finding occurrences of a pattern in some data.  ...  This method yields practical algorithms with fast average-case running times for a wide variety of pattern matching and pattern recognition problems.  ...  If the pattern string and text might have wildcard characters, Fischer and Paterson [S] give an 0 (n log m log log m) based on multiplication.  ... 
doi:10.1016/0304-3975(92)90141-2 fatcat:7qconqx2pfecvkxxabklvtn5wi

Improving the Efficiency of Exact Two Dimensional On-Line Pattern Matching Algorithms

Charalampos S. Kouzinopoulos, Konstantinos G. Margaritis
2008 2008 Panhellenic Conference on Informatics  
This paper presents new efficient variants of the Baker and Bird and the Baeza-Yates and Regnier exact two dimensional pattern matching algorithms.  ...  A sublinear algorithm for two-dimensional string matching.  ...  Aho-Corasick treats each row of the pattern as a keyword and constructs a finite state pattern matching machine that can be used to process each row of the text in a single pass.  ... 
doi:10.1109/pci.2008.8 dblp:conf/pci/KouzinopoulosM08 fatcat:ftnjxayxhvaw3hkm5ujabkilua

Clustering and indexing of experience sequences for popularity-driven recommendations

K. Selçuk Candan, Mehmet E. Dönderler, J. Ramamoorthy, Jong W. Kim
2006 Proceedings of the 3rd ACM workshop on Continuous archival and retrival of personal experences - CARPE '06  
In this paper, we address the challenge of indexing experiences in order to retrieve them based on their popularities.  ...  Thus, we develop a canonicalsequence based approach that significantly reduces the experience sequence retrieval time in the presence of commutations.  ...  BDM algorithm [12] creates a suffix automaton for the input pattern (and it lends itself to parallelizations [31] ).  ... 
doi:10.1145/1178657.1178671 fatcat:oya2dui6xzf25o4652b5eaenvu

Index-supported pattern matching on symbolic trajectories

Fabio Valdés, Ralf Hartmut Güting
2014 Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems - SIGSPATIAL '14  
As a result, the computation cost for the pattern matching is nearly independent from the trajectory size.  ...  A comprehensive framework for describing and querying symbolic trajectories including an expressive pattern language as well as an efficient matching algorithm was presented lately.  ...  Certain patterns cause sublinear runtime curves (as slightly hinted by the graph of P2).  ... 
doi:10.1145/2666310.2666402 dblp:conf/gis/ValdesG14 fatcat:pmqpv7tqzjcepfzqkknmf7oszy
« Previous Showing results 1 — 15 out of 46 results