Sciweavers

11 search results - page 2 / 3
» Processor array architectures for flexible approximate strin...
Sort
View
IPPS
2009
IEEE
13 years 11 months ago
Input-independent, scalable and fast string matching on the Cray XMT
String searching is at the core of many security and network applications like search engines, intrusion detection systems, virus scanners and spam filters. The growing size of o...
Oreste Villa, Daniel G. Chavarría-Miranda, ...
FPGA
2004
ACM
163views FPGA» more  FPGA 2004»
13 years 8 months ago
Time and area efficient pattern matching on FPGAs
Pattern matching for network security and intrusion detection demands exceptionally high performance. Much work has been done in this field, and yet there is still significant roo...
Zachary K. Baker, Viktor K. Prasanna
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
WOB
2004
120views Bioinformatics» more  WOB 2004»
13 years 6 months ago
Reconfigurable Systems for Sequence Alignment and for General Dynamic Programming
ABSTRACT. Reconfigurable systolic arrays can be adapted to efficiently resolve a wide spectrum of computational problems; parallelism is naturally explored in systolic arrays and r...
Ricardo P. Jacobi, Mauricio Ayala-Rincón, L...
CPM
2001
Springer
211views Combinatorics» more  CPM 2001»
13 years 9 months ago
Fuzzy Hamming Distance: A New Dissimilarity Measure
Lempel Ziv Coding (Extended Abstract). . . . . . . . . . . . . . . . . . . . . . . 18 Shmuel Tomi Klein, Yair Wiseman Approximate Matching of Run-Length Compressed Strings . . . . ...
Abraham Bookstein, Shmuel T. Klein, Timo Raita