Results 1  10
of
28,288
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
Bitparallel algorithms for exact circular string matching
 The Computer Journal
, 2014
"... In this paper, we deal with the exact circular string matching problem (abbreviated as ECSM). Given a string P = p1p2 · · ·pm, a string P(i) = pipi+1 · · ·pmp1 · · ·pi−1, for 1 ≤ i ≤ m, is a circular string of P. Given a text string T = t1t2 · · · tn and a pattern P, the ECSM problem is to fin ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
is to find all occurrences of P(i) in text T for 1 ≤ i ≤ m. This paper proposes two algorithms that perform searching of a circular string on text using the bitparallel technique. Our algorithms use only the composition of bitwiselogical operations and basic arithmetic operations, and apply this technique
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
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
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
On Bitparallel Processing of Multibyte Text
 In: Asia Information Retrieval Symposium, AIRS 2004
, 2004
"... There exist practical bitparallel algorithms for several types of pairwise string processing, such as longest common subsequence computation or approximate string matching. The bitparallel algorithms typically use a size# table of match bitvectors, where the bits in the vector for a charact ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
There exist practical bitparallel algorithms for several types of pairwise string processing, such as longest common subsequence computation or approximate string matching. The bitparallel algorithms typically use a size# table of match bitvectors, where the bits in the vector for a
On BitParallel Processing of Multibyte Text
"... Abstract. There exist practical bitparallel algorithms for several types of pairwise string processing, such as longest common subsequence computation or approximate string matching. The bitparallel algorithms typically use a sizeσ table of match bitvectors, where the bits in the vector for a ..."
Abstract
 Add to MetaCart
Abstract. There exist practical bitparallel algorithms for several types of pairwise string processing, such as longest common subsequence computation or approximate string matching. The bitparallel algorithms typically use a sizeσ table of match bitvectors, where the bits in the vector for a
Regular Expression Matching Using BitParallelism A Review of the Fundamentals and of Two BitParallel Algorithms
, 2006
"... In this master’s thesis we are concerned with the classical regular expression matching problem, where it must be decided whether some substring of a text string T consisting of n characters matches one of the patterns specified by the regular expression r consisting of m characters. First, we descr ..."
Abstract
 Add to MetaCart
describe the fundamentals of the problem in a practical and historical context. Then two specific algorithms for solving the problem are described in detail. Both algorithms make use of the technique of bitparallelism, which is then described along with the machine model used throughout the thesis
Efficient randomized patternmatching algorithms
, 1987
"... We present randomized algorithms to solve the
following stringmatching problem and some of its generalizations: Given a string X of length n (the pattern) and a string Y (the text), find the first occurrence of X as a consecutive block within Y. The algorithms represent strings of length n by much ..."
Abstract

Cited by 397 (1 self)
 Add to MetaCart
We present randomized algorithms to solve the
following stringmatching problem and some of its generalizations: Given a string X of length n (the pattern) and a string Y (the text), find the first occurrence of X as a consecutive block within Y. The algorithms represent strings of length n
Widearea cooperative storage with CFS
, 2001
"... The Cooperative File System (CFS) is a new peertopeer readonly storage system that provides provable guarantees for the efficiency, robustness, and loadbalance of file storage and retrieval. CFS does this with a completely decentralized architecture that can scale to large systems. CFS servers pr ..."
Abstract

Cited by 1009 (56 self)
 Add to MetaCart
provide a distributed hash table (DHash) for block storage. CFS clients interpret DHash blocks as a file system. DHash distributes and caches blocks at a fine granularity to achieve load balance, uses replication for robustness, and decreases latency with server selection. DHash finds blocks using
Results 1  10
of
28,288