Filters








127,501 Hits in 2.3 sec

Fast string searching

Andrew Hume, Daniel Sunday
1991 Software, Practice & Experience  
KEY WORDS String searching Pattern matching Boyer-Moore  ...  Since the Boyer-Moore algorithm was described in 1977, it has been the standard benchmark for the practical string search literature. Yet this yardstick compares badly with current practice.  ...  PROPERTIES OF STRING SEARCH ALGORITHMS For the rest of this paper, we define the string searching problem as looking for all occurrences of a string pat of length patlen in another string text of length  ... 
doi:10.1002/spe.4380211105 fatcat:x3q5htorgjbljngmdkei4dvljq

Fast Searching in Packed Strings [article]

Philip Bille
2010 arXiv   pre-print
In this paper we study the worst-case complexity of string matching on strings given in packed representation.  ...  Given strings P and Q the (exact) string matching problem is to find all positions of substrings in Q matching P. The classical Knuth-Morris-Pratt algorithm [SIAM J.  ...  Algorithm S (Packed String Search). Let P be a preprocessed string for a parameter r as above. Given a string Q of length n the algorithm finds all occurrences of P in Q. S1.  ... 
arXiv:0907.3135v2 fatcat:nt26xd3nuvemxnb6qdkr6dip5a

Fast searching in packed strings

Philip Bille
2011 Journal of Discrete Algorithms  
In this paper we study the worst-case complexity of string matching on strings given in packed representation.  ...  Given strings P and Q the (exact) string matching problem is to find all positions of substrings in Q matching P . The classical Knuth-Morris-Pratt algorithm [SIAM J.  ...  Algorithm S (Packed string search). Let P be a preprocessed string for a parameter r as above. Given a string Q of length n the algorithm finds all occurrences of P in Q . S1.  ... 
doi:10.1016/j.jda.2010.09.003 fatcat:geld4rc2jrg4rdaglwoyhi4smy

A fast string searching algorithm

Robert S. Boyer, J. Strother Moore
1977 Communications of the ACM  
An Algori thm is presented that searches for the location, i, of the first occurrence of a character string, pat, in another string, string.  ...  During the search operation, the characters of pat are matched starting wi t.h the last character of pat.  ...  The simple string searching algorithm (when coded with a 3-instruction fast loopl) executes about 3.3 instructions per character (determined empirically on the English sample above).  ... 
doi:10.1145/359842.359859 fatcat:c5mlvu4nwfh5bmnvkowknvryhu

Practical fast searching in strings

R. Nigel Horspool
1980 Software, Practice & Experience  
The problem of searching through text to find a specified substring is considered in a practical setting.  ...  It is discovered that a method developed by Boyer and Moore can outperform even special-purpose search instructions that may be built into the, computer hardware.  ...  CONCLUSIONS An important result is that we have demonstrated the Boyer and Moore algorithms to be an astonishingly fast method of searching text.  ... 
doi:10.1002/spe.4380100608 fatcat:frlexobf6jbbtmcvdfd4bvdt4u

Fast Searching in Packed Strings [chapter]

Philip Bille
2009 Lecture Notes in Computer Science  
In this paper we study the worst-case complexity of string matching on strings given in packed representation.  ...  Given strings P and Q the (exact) string matching problem is to find all positions of substrings in Q matching P . The classical Knuth-Morris-Pratt algorithm [SIAM J.  ...  Algorithm S (Packed string search). Let P be a preprocessed string for a parameter r as above. Given a string Q of length n the algorithm finds all occurrences of P in Q . S1.  ... 
doi:10.1007/978-3-642-02441-2_11 fatcat:myi2u5bngzhdndofkx2xso7fmm

Fast string matching for multiple searches

Peter Fenwick
2001 Software, Practice & Experience  
We present a string matching or pattern matching method which is especially useful when a single block of text must be searched repeatedly for different patterns.  ...  overhead comparable to five to ten conventional searches.  ...  Once that processing is complete, searching then proceeds at about 250 times as fast as KMP or 30 times as fast as TBM. Figure 2 . 2 Essence of Knuth-Morris-Pratt search.  ... 
doi:10.1002/spe.367 fatcat:oenvsamn5fbevob7tnfwkhrnni

A Fast Spatial String Search with Service Composition Method

S. Udhayakumar
2014 IOSR Journal of Engineering  
This work deals with the fast nearest string search in large spatial databases.  ...  General Terms:-Approximate string search, range query, road network, spatial databases.  ...  Approximate string search is necessary when users have a fuzzy search condition, or a spelling error when submittingthe query, or the strings in the database contain some degree of uncertainty or error  ... 
doi:10.9790/3021-04364954 fatcat:wd36i3kb6rgebghyegavnirfrm

FAST STRUCTURAL SIMILARITY SEARCH BASED ON TOPOLOGY STRING MATCHING

SUNG-HEE PARK, DAVID GILBERT, KEUN HO RYU
2007 Proceedings of the 5th Asia-Pacific Bioinformatics Conference  
for fast structural similarity search.  ...  Our method performs well in terms of the quality of matching whilst having the advantage of fast execution and being able to compute similarity search in polynomial time.  ...  Some similarity search methods use fast pre-filtering before performing accurate alignment.  ... 
doi:10.1142/9781860947995_0036 fatcat:wp3l7rh22ngkpo5em2bkfdzwe4

Fast nGram-Based String Search Over Data Encoded Using Algebraic Signatures

Witold Litwin, Riad Mokadem, Philippe Rigaux, Thomas J. E. Schwarz
2007 Very Large Data Bases Conference  
We propose a novel string search algorithm for data stored once and read many times.  ...  Our search method combines the sublinear traversal of the record (as in Boyer Moore or Knuth-Morris-Pratt) with the agglomeration of parts of the record and search pattern into a single character -the  ...  Still, n-gram search performs at least as fast as BM for small patterns, and turns out to be almost twice as fast for large patterns.  ... 
dblp:conf/vldb/LitwinMRS07 fatcat:e3nak4gcc5a5big7hcqdavn35m

Robust and Fast Phonetic String Matching Method for Lyric Searching Based on Acoustic Distance

Xin XU, Tsuneo KATO
2014 IEICE transactions on information and systems  
This paper proposes a robust and fast lyric search method for music information retrieval (MIR).  ...  robustness of the system, the authors introduce acoustic distance, which is computed based on a confusion matrix of an automatic speech recognition experiment, into Dynamic-Programming (DP)-based phonetic string  ...  It uses a fast inverted-index-based search in the first pass and DP-based search with an adaptive termination strategy in the second pass.  ... 
doi:10.1587/transinf.2013edp7418 fatcat:ucwoqcgtp5amdjcozsek7g3yey

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

Almazroi
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.  ...  ZTFS (Cai et al., 2009) is also the combination of Zhu-Takaoka (ZT) and Fast Search (FS) algorithms.  ... 
doi:10.3844/jcssp.2011.644.650 fatcat:jccoprxtsff4ng4llwp6px3f7a

Fast String Searching Mechanism

Petr Hurtik, Petra Hodakova, Irina Perfilieva
2015 Proceedings of the 2015 Conference of the International Fuzzy Systems Association and the European Society for Fuzzy Logic and Technology   unpublished
The goal of this study is to introduce a novel exact string searching (i.e., matching) method based on the fuzzy transform, or F-transform (FTSS).  ...  The results are compared with those of three existing string searching algorithms: Knuth-Morris-Pratt (KMP), Boyer-Moore (BM) and Rabin-Karp (RK).  ...  In this study, we focus on the first type of approach to pattern searching, the exact string match, and we develop a fast string searching method based on the fuzzy transform, or F-transform [8] .  ... 
doi:10.2991/ifsa-eusflat-15.2015.60 fatcat:3hfnw4g72je3bkmwlst4lepsem

Fast multipattern search algorithms for intrusion detection

J. Kuri, G. Navarro
Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000  
We show analytically and experimentally that the algorithms are able of fast searching for large sets of patterns allowing a wide number of spurious characters, yielding in our machine about a 75-fold  ...  Our algorithms exploit the ability to represent the search state of one or more patterns in the bits of a single machine word and update all the search states in a single operation.  ...  A recent approach [18, 16] to the problem of handling a search of increasing complexity and magnitude is to develop systems for fast detection of potential attacks rather that accurate detection of actual  ... 
doi:10.1109/spire.2000.878193 dblp:conf/spire/KuriN00 fatcat:xh72brgih5ds3chiquqlenuvvu

Cumulative Algebraic Signatures for Fast String Search, Protection Against Incidental Viewing and Corruption of Data in an SDDS [chapter]

Witold Litwin, Riad Mokadem, Thomas Schwarz
Databases, Information Systems, and Peer-to-Peer Computing  
Both schemes provide also fast string search (match) directly on encoded data at the SDDS servers.  ...  The algebraic signatures allow for fast string search using an algorithm similar to Karp-Rabin [KR87].  ...  Hence, the algorithm should not only be usually at least as fast as the sequential search, but also should provide a much more stable search time performance.  ... 
doi:10.1007/978-3-540-71661-7_14 dblp:conf/dbisp2p/LitwinMS05 fatcat:uudq7zmuqjcebhujaf76fg37ae
« Previous Showing results 1 — 15 out of 127,501 results