Processor array architectures for flexible approximate string matching

A programmable array processor architecture for flexible approximate string matching algorithms

“…This structure was obtained as a result of applying the data dependence graph method [24] to the partitioned realization of a variety of approximate string matching algorithms presented in Sections 2 and 3. More details for the mapping of previous approximate string matching algorithms to specific array processor architectures using the dependence graph method is presented in [46,43]. In all those cases the method produced arrays with the same architecture, which led us to conclude that a class-specific array for the efficient execution of a class of algorithms was possible.…”

“…In all those cases the method produced arrays with the same architecture, which led us to conclude that a class-specific array for the efficient execution of a class of algorithms was possible. The overall architecture is determined by the realization procedure presented in [24,46,43], whereas The array controller will be responsible for issuing signals to the array and for controlling communication with the host system.…”

“…A number of arrays processors have been proposed by several researchers for approximate string matching and LCS [11,6,36,37,38,22,57,56,42,26,15,27,18,62,40] and [55,68,30,28,29,31,32,39,33,35,34], respectively. Recently, we proposed the array processors architectures which perform approximate string matching for flexible patterns that contain don't care, complement and classes symbols [46,43,45,47,48]. The above-mentioned application specific arrays processors can provide the fastest means of running a particular algorithm with very high processing element (PE) density.…”

A pipelined processor architecture for regular expression string matching

“…But these approaches depend on the expressions as they has to rebuild the HDL (Hardware Description Language) description when the regular expressions change. Michailidis and Margaritis [8] used parallel realization of dynamic programming and NFA algorithms which consist of preprocessing and searching phases. The proposed architectures in [8] support flexible patterns with a ''don't care'' symbol.…”

“…Michailidis and Margaritis [8] used parallel realization of dynamic programming and NFA algorithms which consist of preprocessing and searching phases. The proposed architectures in [8] support flexible patterns with a ''don't care'' symbol. Joao [9] used NFA to support complex regular expressions.…”