title: Families of FPGA-Based Accelerators for Approximate String Matching.
abstract: Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many implementations have reported impressive speed-ups, but have typically been point solutions - highly specialized and addressing only one or a few of the many possible options. The problem to be solved is creating a hardware description that implements a broad range of behavioral options without losing efficiency due to feature bloat. We report a set of three component types that address different parts of the approximate string matching problem. This allows each application to choose the feature set required, then make maximum use of the FPGA fabric according to that application's specific resource requirements. Multiple, interchangeable implementations are available for each component type. We show that these methods allow the efficient generation of a large, if not complete, family of accelerators for this application. This flexibility was obtained while retaining high performance: We have evaluated a sample against serial reference codes and found speed-ups of from 150× to 400× over a high-end PC.
authors: Department of Electrical and Computer Engineering Boston University.
authors: Tom
authors: T
authors: Van Court
authors: Martin C
authors: MC
authors: Herbordt
references: Science. 1989 May 12;244(4905):655-6
references: 2717944
references: J Mol Biol. 1970 Mar;48(3):443-53
references: 5420325