Systolic Array Technique for Determining Common Approximate Substrings

Details Systolic Array Technique for Determining Common Approximate Substrings Systolic Array Technique for Determining Common Approximate Substrings

2010-06-06

arxiv.org/abs/1006.1104v1

Journal of Computer Science and Engineering, Volume 1, Issue 1, p1-9, May 2010

Computer Science

Data Structures and Algorithms

Submitted to Journal of Computer Science and Engineering, see http://sites.google.com/site/jcseuk/volume-1-issue-1-may-2010

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Systolic Array Technique for Determining Common Approximate Substrings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Systolic Array Technique for Determining Common Approximate Substrings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Systolic Array Technique for Determining Common Approximate Substrings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-682018