Results 1  10
of
5,235
On the Expected Sublinearity of the BoyerMoore Algorithm
, 1988
"... . This paper analyzes the expected performance of a simplified version BM 0 of the BoyerMoore string matching algorithm. A probabilistic automaton A is set up which models the expected behavior of BM 0 under the assumption that both text and pattern are generated by a source which emits indepe ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
. This paper analyzes the expected performance of a simplified version BM 0 of the BoyerMoore string matching algorithm. A probabilistic automaton A is set up which models the expected behavior of BM 0 under the assumption that both text and pattern are generated by a source which emits
Average Case Analysis of the BoyerMoore Algorithm
, 2003
"... Some limit theorems (including a BerryEsseen bound) are derived for the number of comparisons taken by the BoyerMoore algorithm for finding the occurrences of a given pattern in a random Markovian text. Previously, only special variants of this algorithm have been analyzed. We also propose means o ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Some limit theorems (including a BerryEsseen bound) are derived for the number of comparisons taken by the BoyerMoore algorithm for finding the occurrences of a given pattern in a random Markovian text. Previously, only special variants of this algorithm have been analyzed. We also propose means
Searching BWT compressed text with the BoyerMoore algorithm and binary search
 Proceedings, IEEE Data Compression Conference, 2002
, 2002
"... Abstract: This paper explores two techniques for online exact pattern matching in files that have been compressed using the BurrowsWheeler transform. We investigate two approaches. The first is an application of the BoyerMoore algorithm (Boyer & Moore 1977) to a transformed string. The second ..."
Abstract

Cited by 13 (7 self)
 Add to MetaCart
Abstract: This paper explores two techniques for online exact pattern matching in files that have been compressed using the BurrowsWheeler transform. We investigate two approaches. The first is an application of the BoyerMoore algorithm (Boyer & Moore 1977) to a transformed string
Data Mining Model For Network Intrusion Detection Using BoyerMoore Algorithm B Veerendranath
"... ..."
SOFTWARE—PRACTICE AND EXPERIENCE, VOL. 27(7), 851–861 (JULY 1997) String Matching in the DNA Alphabet
"... Searching for long DNA strings is studied. A qgram variation of the Boyer–Moore algorithm is considered. An alphabet transformation with precomputed tables is utilized to reduce the processingtime. Experimental results show that the new algorithm is efficient in practice. ©1997 by John Wiley & ..."
Abstract
 Add to MetaCart
Searching for long DNA strings is studied. A qgram variation of the Boyer–Moore algorithm is considered. An alphabet transformation with precomputed tables is utilized to reduce the processingtime. Experimental results show that the new algorithm is efficient in practice. ©1997 by John Wiley &
On Obtaining the BoyerMoore StringMatching Algorithm by Partial Evaluation ∗
, 2005
"... We present the first derivation of the search phase of the BoyerMoore stringmatching algorithm by partial evaluation of an inefficient string matcher. The derivation hinges on identifying the badcharactershift heuristic as a bindingtime improvement, bounded static variation. An inefficient string ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present the first derivation of the search phase of the BoyerMoore stringmatching algorithm by partial evaluation of an inefficient string matcher. The derivation hinges on identifying the badcharactershift heuristic as a bindingtime improvement, bounded static variation. An inefficient
A New Method to Obtain the shifttable in BoyerMoore’s String Matching Algorithm
"... The BoyerMoore algorithm uses two precomputed tables for searching a string: skip, which utilizes the occurrence heuristic of symbols in a pattern, and shift, which utilizes the match heuristic of the pattern. Researchers have pointed out that the difficulty of understanding the computation of the ..."
Abstract
 Add to MetaCart
The BoyerMoore algorithm uses two precomputed tables for searching a string: skip, which utilizes the occurrence heuristic of symbols in a pattern, and shift, which utilizes the match heuristic of the pattern. Researchers have pointed out that the difficulty of understanding the computation
On the shifttable in BoyerMoore’s String Matching Algorithm
"... The BoyerMoore’s string matching algorithm uses two precomputed tables skip, which utilizes the occurrence heuristic of symbols in a pattern, and shift, which utilizes the match heuristic of the pattern, for searching a string. Some experts have pointed out that the difficulty of understanding the ..."
Abstract
 Add to MetaCart
The BoyerMoore’s string matching algorithm uses two precomputed tables skip, which utilizes the occurrence heuristic of symbols in a pattern, and shift, which utilizes the match heuristic of the pattern, for searching a string. Some experts have pointed out that the difficulty of understanding
Deriving the BoyerMooreHorspool algorithm
"... frequently studied, and many different algorithms for solving it have been suggested. Watson and Zwaan in the early 1990s derived a set of wellknown solutions from a common starting point, leading to a taxonomy of such algorithms. Their taxonomy did not include a variant of the BoyerMoore algorith ..."
Abstract
 Add to MetaCart
frequently studied, and many different algorithms for solving it have been suggested. Watson and Zwaan in the early 1990s derived a set of wellknown solutions from a common starting point, leading to a taxonomy of such algorithms. Their taxonomy did not include a variant of the BoyerMoore
A Mechanically Checked Proof of the Correctness of the BoyerMoore Fast String Searching Algorithm
"... Abstract. We describe a mechanically checked proof that the BoyerMoore fast string searching algorithm is correct. This is done by expressing both the fast algorithm and the naïve (obviously correct) algorithm as functions in applicative Common Lisp and proving them equivalent with the ACL2 theorem ..."
Abstract
 Add to MetaCart
Abstract. We describe a mechanically checked proof that the BoyerMoore fast string searching algorithm is correct. This is done by expressing both the fast algorithm and the naïve (obviously correct) algorithm as functions in applicative Common Lisp and proving them equivalent with the ACL2
Results 1  10
of
5,235