Systolic Array Technique for Determining Common Approximate Substrings

TL;DR

This paper introduces a systolic array-based method for efficiently solving the common approximate substring problem, extending previous work on edit-distance computation, and validates its effectiveness through simulations.

Contribution

It presents a novel systolic array technique specifically designed for the CAS problem, expanding on prior edit-distance methods.

Findings

Validated through simulations showing effectiveness

Extends previous edit-distance techniques to CAS

Offers a potentially faster hardware solution

Abstract

A technique using a systolic array structure is proposed for solving the common approximate substring (CAS) problem. This approach extends the technique introduced in earlier work from the computation of the edit-distance between two strings to the more encompassing CAS problem. A comparison to existing work is given, and the technique presented is validated and analyzed based on simulations.