One, Two, Three and N Dimensional String Search Algorithms
Data Structures and Algorithms
2010-11-03 v2
Abstract
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.
Cite
@article{arxiv.1009.3809,
title = {One, Two, Three and N Dimensional String Search Algorithms},
author = {Ramesh C. Bagadi},
journal= {arXiv preprint arXiv:1009.3809},
year = {2010}
}
Comments
withdrawn by arXiv admin due to authorship dispute