Parallel Architecture for Flexible Approximate Text Searching
Approximate string matching is one of the main problems in classical string algorithms, with applications to information retrieval, computational biology, artificial intelligence, web search engines and text mining. In this paper, the authors present a processor array design for flexible approximate string matching. Initially, a sequential algorithm is discussed which consists of two phases, i.e. preprocessing and searching. Then, starting from the computational schedule of the searching phase a parallel architecture is derived. Further, the preprocessing phase is also accommodated onto the same architecture.