Systolic Array Technique for Determining Common Approximate Substrings
Data Structures and Algorithms
2010-06-08 v1
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.
Keywords
Cite
@article{arxiv.1006.1104,
title = {Systolic Array Technique for Determining Common Approximate Substrings},
author = {Jacqueline E. Rice and Kenneth B. Kent},
journal= {arXiv preprint arXiv:1006.1104},
year = {2010}
}
Comments
Submitted to Journal of Computer Science and Engineering, see http://sites.google.com/site/jcseuk/volume-1-issue-1-may-2010