Sciweavers

102 search results - page 2 / 21
» Fast exact string matching algorithms
Sort
View
BIRD
2008
Springer
221views Bioinformatics» more  BIRD 2008»
13 years 7 months ago
Comparison of Exact String Matching Algorithms for Biological Sequences
Exact matching of single patterns in DNA and amino acid sequences is studied. We performed an extensive experimental comparison of algorithms presented in the literature. In additi...
Petri Kalsi, Hannu Peltola, Jorma Tarhio
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
13 years 5 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro
ICDE
2012
IEEE
252views Database» more  ICDE 2012»
11 years 7 months ago
Approximate String Membership Checking: A Multiple Filter, Optimization-Based Approach
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...
Chong Sun, Jeffrey F. Naughton, Siddharth Barman
CPM
2005
Springer
206views Combinatorics» more  CPM 2005»
13 years 10 months ago
A Fast Algorithm for Approximate String Matching on Gene Sequences
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
Zheng Liu, Xin Chen, James Borneman, Tao Jiang
ICPR
2002
IEEE
14 years 6 months ago
A Windowed Weighted Approach for Approximate Cyclic String Matching
A method for measuring dissimilarities between cyclic strings is introduced. It computes a weighted mean between two (lower and upper) bounds of the exact cyclic edit distance, wh...
Ramón Alberto Mollineda, Enrique Vidal, Fra...