One, Two, Three and N Dimensional String Search Algorithms

Details One, Two, Three and N Dimensional String Search Algorithms One, Two, Three and N Dimensional String Search Algorithms

2010-09-20

arxiv.org/abs/1009.3809v2

Computer Science

Data Structures and Algorithms

withdrawn by arXiv admin due to authorship dispute

Scientific paper

In this research endeavor, some Sequence Alignment Algorithms are detailed that are useful for finding or comparing 1 dimensional (1-D), 2 dimensional (2-D), 3 dimensional (3-D) sequences in or against a parent or mother database which is 1 dimensional (1-D), 2 dimensional (2-D), 3 dimensional (3-D) sequence. Inner Product [1], [2] based schemes are used to lay down such algorithms. Also,in this research, a Sequence Alignment Algorithms is detailed that is useful for finding or comparing an N-Dimensional (N-D) sequence in or against a parent or mother database which N-Dimensional (N-D) sequence. Inner Product [1], [2] based schemes are used to lay down such an algorithm.

Affiliated with

Also associated with

No associations

Rating

One, Two, Three and N Dimensional String Search Algorithms 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 One, Two, Three and N Dimensional String Search Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and One, Two, Three and N Dimensional String Search Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-264803