VLSI array processors
VLSI architectures for string matching and pattern matching
Pattern Recognition
Fast parallel and serial approximate string matching
Journal of Algorithms
Rapid implementation of a genetic sequence comparator using field-programmable logic arrays
Proceedings of the 1991 University of California/Santa Cruz conference on Advanced research in VLSI
A new approach to text searching
Communications of the ACM
Fast text searching: allowing errors
Communications of the ACM
Parallel string matching with variable length don't cares
Journal of Parallel and Distributed Computing
A constant-time optimal parallel string-matching algorithm
Journal of the ACM (JACM)
String matching on multicontext FPGAs using self-reconfiguration
FPGA '99 Proceedings of the 1999 ACM/SIGDA seventh international symposium on Field programmable gate arrays
A fast bit-vector algorithm for approximate string matching based on dynamic programming
Journal of the ACM (JACM)
The String-to-String Correction Problem
Journal of the ACM (JACM)
A guided tour to approximate string matching
ACM Computing Surveys (CSUR)
Fast and flexible string matching by combining bit-parallelism and suffix automata
Journal of Experimental Algorithmics (JEA)
CASM: A VLSI Chip for Approximate String Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
Design and Implementation of a Parallel Architecture for Biological Sequence Comparison
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing - Volume I
A Unified View to String Matching Algorithms
SOFSEM '96 Proceedings of the 23rd Seminar on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
FPL '02 Proceedings of the Reconfigurable Computing Is Going Mainstream, 12th International Conference on Field-Programmable Logic and Applications
A Run-Time Reconfigurable System for Gene-Sequence Searching
VLSID '03 Proceedings of the 16th International Conference on VLSI Design
A Systolic Array for the Sequence Alignment Problem
A Systolic Array for the Sequence Alignment Problem
Hyper customized processors for bio-sequence database scanning on FPGAs
Proceedings of the 2005 ACM/SIGDA 13th international symposium on Field-programmable gate arrays
Fast Regular Expression Matching Using FPGAs
FCCM '01 Proceedings of the the 9th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
A pipelined processor architecture for regular expression string matching
Microprocessors & Microsystems
Hi-index | 0.00 |
In this paper, we present linear processor array architectures for flexible approximate string matching. These architectures are based on parallel realization of dynamic programming and non-deterministic finite automaton algorithms. The algorithms consist of two phases, i.e. preprocessing and searching. Then, starting from the data dependence graphs of the searching phase, parallel algorithms are derived, which can be realized directly onto special purpose processor array architectures for approximate string matching. Further, the preprocessing phase is also accommodated onto the same processor array designs. Finally, the proposed architectures support flexible patterns i.e. patterns with a ''don't care'' symbol, patterns with a complement symbol and patterns with a class symbol.