The Complexity and Application of Syntactic Pattern Recognition Using Finite Inductive Strings
We describe herein the results of implementing an algorithm for syntactic pattern recognition using the concept of Finite Inductive Sequences (FI). We discuss this idea, and then provide a big O estimate of the time to execute for the algorithms. We then provide some empirical data to support the analysis of the timing. This timing is critical if one wants to process millions of symbols from multiple sequences simultaneously. Lastly, we provide an example of the two FI algorithms applied to actual data taken from a gene and then describe some results as well as the associated data derived from this example.
KeywordsPattern Recognition finite induction syntactic pattern recognition algorithm complexity
- 5.Source used for data in this paper, http://www.ncbi.nlm.nih.gov/nuccore/12751174
- 7.Fisher, P.S., Baek, J., Adeyeye, J., Setubal, J.: Finite Inductive Sequences, Kolmogorov Complexity with Application to Genome Sequences. In: International Conference on Bioinformatics, Computational Biology, Genomics and Chemoinformatics, BCBGC-10 (July 2010)Google Scholar