A systolic array technique for determining common approximate substrings

— A new technique that makes use of a systolic array structure is proposed for solving the common approximate substring (CAS) problem. This approach extends the technique introduced in [1] from the computation of the edit-distance between two strings to the more encompassing CAS problem. The technique presented is validated and analyzed through simulation.

• Type: Conference
• Year: 2006
• Where: ISCAS
• Authors: Kenneth B. Kent, Jacqueline E. Rice
• Keywords: Common Approximate Substring, Encompassing Cas Problem, ISCAS 2006, Systolic Array Structure