Sciweavers

3270 search results - page 16 / 654
» Approximate String Processing
Sort
View
CPM
1999
Springer
141views Combinatorics» more  CPM 1999»
13 years 12 months ago
Approximate Periods of Strings
The study of approximately periodic strings is relevant to diverse applications such as molecular biology, data compression, and computer-assisted music analysis. Here we study di...
Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park,...
CPM
2008
Springer
148views Combinatorics» more  CPM 2008»
13 years 9 months ago
On-Line Approximate String Matching with Bounded Errors
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
Marcos A. Kiwi, Gonzalo Navarro, Claudio Telha
FCCM
2006
IEEE
137views VLSI» more  FCCM 2006»
14 years 1 months ago
Single Pass, BLAST-Like, Approximate String Matching on FPGAs
Abstract: Approximate string matching is fundamental to bioinformatics, and has been the subject of numerous FPGA acceleration studies. We address issues with respect to FPGA imple...
Martin C. Herbordt, Josh Model, Yongfeng Gu, Bhara...
APPROX
2007
Springer
92views Algorithms» more  APPROX 2007»
14 years 1 months ago
Sublinear Algorithms for Approximating String Compressibility
We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popu...
Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, A...
IPPS
2002
IEEE
14 years 14 days 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