Sciweavers

CPM
2000
Springer
124views Combinatorics» more  CPM 2000»
13 years 8 months ago
Indexing Text with Approximate q-Grams
We present a new index for approximate string matching. The index collects text q-samples, that is, disjoint text substrings of length q, at fixed intervals and stores their posi...
Gonzalo Navarro, Erkki Sutinen, Jani Tanninen, Jor...
IPPS
2002
IEEE
13 years 9 months ago
Approximate String Matching in LDAP Based on Edit Distance
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
Chi-Chien Pan, Kai-Hsiang Yang, Tzao-Lin Lee
ISAAC
2003
Springer
117views Algorithms» more  ISAAC 2003»
13 years 9 months ago
Approximate Regular Expression Searching with Arbitrary Integer Weights
Abstract. We present a bit-parallel technique to search a text of length n for a regular expression of m symbols permitting k differences in worst case time O(mn/ logk s), where s...
Gonzalo Navarro
IRAL
2003
ACM
13 years 9 months ago
Dynamic programming matching for large scale information retrieval
Though dynamic programming matching can carry out approximate string matching when there may be deletions or insertions in a document, its effectiveness and efficiency are usuall...
Eiko Yamamoto, Masahiro Kishida, Yoshinori Takenam...
DASFAA
2003
IEEE
151views Database» more  DASFAA 2003»
13 years 9 months ago
Approximate String Matching in DNA Sequences
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
Lok-Lam Cheng, David Wai-Lok Cheung, Siu-Ming Yiu
SPIRE
2005
Springer
13 years 9 months ago
Faster Generation of Super Condensed Neighbourhoods Using Finite Automata
We present a new algorithm for generating super condensed neighbourhoods. Super condensed neighbourhoods have recently been presented as the minimal set of words that represent a p...
Luís M. S. Russo, Arlindo L. Oliveira
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
CSB
2005
IEEE
139views Bioinformatics» more  CSB 2005»
13 years 10 months ago
Using Parallel Algorithms for Searching Molecular Sequence Databases
This work presents the development of algorithms for approximate string matching using parallel methods. It intends to do the maximum of molecular sequences comparisons per unity ...
Carla Correa Tavares dos Reis, Rubem P. Mondaini
IPPS
2006
IEEE
13 years 10 months ago
Implementation of a programmable array processor architecture for approximate string matching algorithms on FPGAs
Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array p...
Panagiotis D. Michailidis, Konstantinos G. Margari...