Results 1  10
of
265,807
BitParallel Multiple Pattern Matching
 PARALLEL PROCESSING AND APPLIED MATHEMATICS / PARALLEL BIOCOMPUTING CONFERENCE (PPAM / PBC)
, 2011
"... Text matching with errors is a regular task in computational biology. We present an extension of the bitparallel WuManber algorithm [16] to combine several searches for a pattern into a collection of fixedlength words. We further present an OpenCL parallelization of a redundant index on massively ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Text matching with errors is a regular task in computational biology. We present an extension of the bitparallel WuManber algorithm [16] to combine several searches for a pattern into a collection of fixedlength words. We further present an OpenCL parallelization of a redundant index
A Guided Tour to Approximate String Matching
 ACM COMPUTING SURVEYS
, 1999
"... We survey the current techniques to cope with the problem of string matching allowing errors. This is becoming a more and more relevant issue for many fast growing areas such as information retrieval and computational biology. We focus on online searching and mostly on edit distance, explaining t ..."
Abstract

Cited by 584 (38 self)
 Add to MetaCart
We survey the current techniques to cope with the problem of string matching allowing errors. This is becoming a more and more relevant issue for many fast growing areas such as information retrieval and computational biology. We focus on online searching and mostly on edit distance, explaining
Increased BitParallelism for Approximate and Multiple String Matching
"... Bitparallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for the approximate occurrences of a pattern of length m in a text of length n in time O(⌈m/w⌉n), where w is the number of bits in the ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Bitparallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for the approximate occurrences of a pattern of length m in a text of length n in time O(⌈m/w⌉n), where w is the number of bits
Increased BitParallelism for Approximate and Multiple String Matching
"... cfl 20YY ACM 00000000/20YY/00000001 $5.00 ACM Journal Name, Vol. V, No. N, Month 20YY, Pages 12. 2 \Delta H. Hyyr"o et al. Bitparallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching ..."
Abstract
 Add to MetaCart
for the approximate occurrences of a pattern of length m in a text of length n in time O(dm=wen), where w is the number of bits in the computer word. Although this is asymptotically the optimal bitparallel speedup over the basic O(mn) time algorithm, it wastes bitparallelism's power in the common case where m
Increased BitParallelism for Approximate and Multiple String Matching
"... ACM Journal Name, Vol. V, No. N, Month 20YY, Pages 12. 2 * H. Hyyr"o et al. Bitparallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for the approximate occurrences of a pattern of l ..."
Abstract
 Add to MetaCart
ACM Journal Name, Vol. V, No. N, Month 20YY, Pages 12. 2 * H. Hyyr"o et al. Bitparallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for the approximate occurrences of a pattern
Bitparallel Witnesses and their Applications to Approximate String Matching
 Algorithmica
, 2005
"... We present a new bitparallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a pattern of length m in a text of length n permitting k differences in O(⌈m/w⌉n) time, where w is the width ..."
Abstract

Cited by 24 (3 self)
 Add to MetaCart
We present a new bitparallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a pattern of length m in a text of length n permitting k differences in O(⌈m/w⌉n) time, where w
Increased BitParallelism for Approximate String Matching
 In Proc. 3rd Workshop on Efficient and Experimental Algorithms (WEA’04), LNCS 3059
, 2004
"... Bitparallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for the approximate... ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
Bitparallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for the approximate...
String theory and noncommutative geometry
 JHEP
, 1999
"... We extend earlier ideas about the appearance of noncommutative geometry in string theory with a nonzero Bfield. We identify a limit in which the entire string dynamics is described by a minimally coupled (supersymmetric) gauge theory on a noncommutative space, and discuss the corrections away from ..."
Abstract

Cited by 801 (8 self)
 Add to MetaCart
We extend earlier ideas about the appearance of noncommutative geometry in string theory with a nonzero Bfield. We identify a limit in which the entire string dynamics is described by a minimally coupled (supersymmetric) gauge theory on a noncommutative space, and discuss the corrections away from
Twenty Years of BitParallelism in String Matching
"... Abstract. It has been twenty years since the publication of the two seminal papers of BaezaYates and Gonnet and of Wu and Manber in the September 1992 issue of the Communications of the ACM. The use of intrinsic parallelism of the bit operations inside a computer word, the socalled bitparallelism ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
of papers were published describing string matching algorithms using this technique. In this survey we will review these solutions for exact single string matching, for exact multiple string matching and for approximate single string matching. 1
Results 1  10
of
265,807