90 Hits in 2.9 sec

Mobile-Based Word Matching Detection using Intelligent Predictive Algorithm

Hamidah Jantan, Nurul Aisyiah Baharudin
2019 International Journal of Interactive Mobile Technologies  
There are several algorithms have been used for string search and matching such as Knuth Morris Pratt, Boyer Moore, Horspool, Intelligent Predictive and many other.  ...  The result shows that the IP algorithm for string searching process is more efficient in execution time compared to well-known algorithm i.e. Boyer Moore algorithm.  ...  Boyer Moore, Horspool and Knuth Morris Pratt algorithms are among the string search algorithms widely used for word matching.  ... 
doi:10.3991/ijim.v13i09.10848 fatcat:z4l74a3dmndkfbckm4fd4u354a

Average running time of the Boyer-Moore-Horspool algorithm

Ricardo A. Baeza-Yates, Mireille Régnier
1992 Theoretical Computer Science  
Concluding remarks In this paper we have realized an extensive study of a Boyer-Moore-type string searching algorithm. We first derived an average analysis of the Boyer-Mooree Horspool algorithm.  ...  The Boyer-Moore-Horspool algorithm. As a convenience for further analysis, we use a pattern of length m + 1 instead of m.  ... 
doi:10.1016/0304-3975(92)90133-z fatcat:qrtfiy5eibfohktty22msgonhe

Measuring the Propagation of Information in Partial Evaluation

Henning Korsholm Rohde
2005 BRICS Report Series  
<br /> <br />Our analysis includes a framework that lets us obtain string matchers - notably the family of Boyer-Moore algorithms - in a systematic formalism-independent way from a few information-propagation  ...  Our analysis is based on measuring implementations of string-matching algorithms, based on the observation that the sequence of character comparisons accurately reflects maintained information.  ...  I am also grateful to Mads Sig Ager, Torben Amtoft, and Neil Jones for insightful comments to preliminary versions of this article.  ... 
doi:10.7146/brics.v12i26.21893 fatcat:i7pc455xlnc5hmodejl66nizwi

Exact Online String Matching Bibliography [article]

Simone Faro
2016 arXiv   pre-print
Since 1970 more than 120 string matching algorithms have been proposed. In this note we present a comprehensive list of (almost) all string matching algorithms. The list is updated to May 2016.  ...  In this short note we present a comprehensive bibliography for the online exact string matching problem. The problem consists in finding all occurrences of a given pattern in a text.  ...  Boyer-Moore-Horspool using Probabilities (PBMH) -2006 Appeared in [84] Combination of (11) and (5) .  ... 
arXiv:1605.05067v1 fatcat:2nr7bjtafjfmjgpfcfbyjnr6oq

E 2 xB: A Domain-Specific String Matching Algorithm for Intrusion Detection [chapter]

K. G. Anagnostakis, S. Antonatos, E. P. Markatos, M. Polychronakis
2003 Security and Privacy in the Age of Uncertainty  
String matching computations dominate in the overall cost of running a NIDS, despite the use of efficient general-purpose string matching algorithms.  ...  Aiming at increasing the efficiency and capacity of NIDSes, we have designed E 2 xB, a string matching algorithm that is tailored to the specific characteristics of NIDS string matching.  ...  Work of the first author is also supported in part by the DoD University Research Initiative (URI) program ad-  ... 
doi:10.1007/978-0-387-35691-4_19 fatcat:cuxvz4bylnhn3mwdqfhjylvfcq

Intelligent Predictive String Search Algorithm

Dipendra Gurung, Udit Kr. Chakraborty, Pratikshya Sharma
2016 Procedia Computer Science  
The proposed algorithm has been developed after analyzing the existing algorithms such as KMP, Boyer-Moore and Horspool.  ...  Based on the variety of applications coming up in areas of data and information mining, sentiment analysis, DNA pattern matching etc, this simple, elegant and intelligent algorithm will find its application  ...  Survey of Existing Algorithms Boyer Moore Algorithm The Boyer Moore algorithm is one of the most extensively used pattern matching algorithms.  ... 
doi:10.1016/j.procs.2016.03.116 fatcat:gl6ntke5ljctzja7yko7tm4hwe

Fast Exact String Pattern-matching Algorithms Adapted to the Characteristics of the Medical Language

C. Lovis, R. H. Baud
2000 JAMIA Journal of the American Medical Informatics Association  
Results: The Boyer-Moore-Horspool algorithm achieves the best overall results when used with medical texts. This algorithm usually performs at least twice as fast as the other algorithms tested.  ...  Design: The authors first illustrate and discuss the techniques of various string pattern-matching algorithms.  ...  The Boyer-Moore-Horspool Algorithm The Boyer-Moore algorithm ( Figure 5 ) is considered the most efficient string-matching algorithm for natural language.  ... 
doi:10.1136/jamia.2000.0070378 pmid:10887166 pmcid:PMC61442 fatcat:gkva4qq5xfaatmcfqlpybvorjm

Approximate Boyer–Moore String Matching

Jorma Tarhio, Esko Ukkonen
1993 SIAM journal on computing (Print)  
The Boyer-Moore idea applied in exact string matching is generalized to approximate string matching. Two versions of the problem are considered.  ...  Both algorithms are functionally equivalent with the Horspool version of the Boyer-Moore algorithm when k = 0.  ...  The k mismatches problem Boyer-Moore-Horspool algorithm The characteristic feature of the Boyer-Moore algorithm [BoM77] for exact matching of string patterns is the right-to-left scan over the pattern  ... 
doi:10.1137/0222018 fatcat:pbbjsiuqpvf3rdnphzci3kcdq4

Adaptive File Comparison Technique for Secured Data Transmission Environment

S. Srinivasan, C. Chandrasekar
2013 Research Journal of Applied Sciences Engineering and Technology  
The comparison technique compares the sparse matrices of source and destination files to find the content similarity and dissimilarity which leads to an efficient content matching technique rather than  ...  Huge amount of data are stored in the network security environment and quantities of data in these fields tend to increase year on year.  ...  • Boyer-Moore (BM) Algorithm • Boyer-Moore-Horspool (BMH) Algorithm • Reverse Factor (RF) Algorithm • Karp-Rabin (KR) Algorithm • Knuth-Morris-Pratt (KMP) Algorithm These are the string matching algorithms  ... 
doi:10.19026/rjaset.5.4834 fatcat:yzpviq2ymrgcnbygkvg3yyevg4

An analysis of the Intelligent Predictive String Search Algorithm: A Probabilistic Approach

Dipendra Gurung, Udit Kr. Chakraborty, Pratikshya Sharma
2017 International Journal of Information Technology and Computer Science  
In the search of a string, the algorithm relies on a chance process and a certain probability at each step. An analysis of the algorithm based on the approach suggested by A. A.  ...  This paper presents a string searching algorithm that incorporates a certain degree of intelligence to search for a string in a text.  ...  Horspool Algorithm The good suffix heuristic of the Boyer Moore algorithm is complicated and difficult to implement, Horspool suggested a refinement that uses only the bad character heuristic while achieving  ... 
doi:10.5815/ijitcs.2017.02.08 fatcat:qz2qi6rj4fgjtdabzf5rp2aa7y

Artificial Neural Network based String Matching Algorithms for Species Classification A Preliminary Study and Experimental Results

Sathish KumarS, N. Duraipandian
2012 International Journal of Computer Applications  
The preliminary research in the area of applications of neural networks and pattern matching algorithms in species classification is presented.  ...  Artificial neural networks for classification and different pattern matching algorithms for matching the given DNA patterns or strings with the existing DNA sequences available in the databases are specifically  ...  T equal to P or -1if no such substring exists for I  0 until n do begin Boyer-Moore-Horspool Algorithm or Horspool Algorithm The Boyer-Moore algorithm uses two heuristics in order to determine the  ... 
doi:10.5120/8270-1832 fatcat:azp4b4yxezhq7ecku3k6vgquli

Approximate String Matching [chapter]

Gonzalo Navarro
2014 Encyclopedia of Algorithms  
Knuth-Morris-Pratt y x Text y y x Text y x Text Horspool Sunday Match heuristic Occurrence heuristic Match heuristic defines BM automata 11 String Searching: Historical  ...  Boyer-Moore-Horspool-Sunday AlgorithmMatch heuristic can be extended: BM automata, suffix automataIn practice the occurrence heuristic is the key issue: Indexed search Hybrid solutions Complexity  ... 
doi:10.1007/978-3-642-27848-8_363-2 fatcat:ygysi27jpvga5bk2ju6cgbgqfa

A New Multiple-Pattern Matching Algorithm for the Network Intrusion Detection System

Nguyen Le Dang, Dac Nhuong Le, Vinh Trong Le
2016 International Journal of Engineering and Technology  
String matching algorithms are essential for network application devices that filter packets and flows based on their payload.  ...  Theoretical analysis and experimental results, when compared with previously known pattern-matching algorithms, show that our algorithm is highly efficient in both space and time.  ...  ACKNOWLEDGMENT This research is partly supported by the QG.12.21 project of Vietnam National University, Hanoi  ... 
doi:10.7763/ijet.2016.v6.865 fatcat:n4bchvwbpra23fbxscgicipkwm

State of the Art for String Analysis and Pattern Search Using CPU and GPU Based Programming

Mario Góngora-Blandón, Miguel Vargas-Lombardo
2012 Journal of Information Security  
In this article we perform a review of the state of the art of the different string matching algorithms used in network intrusion detection systems; and also some research done about CPU and GPU on this  ...  String matching algorithms are an important piece in the network intrusion detection systems. In these systems, the chain coincidence algorithms occupy more than half the CPU process time.  ...  Both Fisk and Vagese [11] optimized the Boyer-Moore-Horspool algorithm for it to process a set of rules (strings) simultaneously.  ... 
doi:10.4236/jis.2012.34038 fatcat:izxoh5fuvfgkhmp7e4t7pxtqwe

A Fast Hybrid Algorithm Approach for the Exact String Matching Problem Via Berry Ravindran and Alpha Skip Search Algorithms

2011 Journal of Computer Science  
Problem statement: String matching algorithm had been an essential means for searching biological sequence database.  ...  Conclusion: The new proposed hybrid algorithm is relevant for searching biological science sequence database and also other string search systems.  ...  The hybrid is made of Zhu-Takaoka (ZT) and Boyer-Moore-Horspool (BMH) algorithms and it is useful for searching in biological sequences database and also well-known for small alphabets and long patterns  ... 
doi:10.3844/jcssp.2011.644.650 fatcat:jccoprxtsff4ng4llwp6px3f7a
« Previous Showing results 1 — 15 out of 90 results