Advertisement

The Complexity and Application of Syntactic Pattern Recognition Using Finite Inductive Strings

  • Elijah Myers
  • Paul S. Fisher
  • Keith Irwin
  • Jinsuk Baek
  • Joao Setubal
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6282)

Abstract

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.

Keywords

Pattern Recognition finite induction syntactic pattern recognition algorithm complexity 

References

  1. 1.
    Buhler, J., Tompa, M.: Finding Motifs Using Random Projections. Journal of Computational Biology 9(2), 225–242 (2002)CrossRefPubMedGoogle Scholar
  2. 2.
    Li, G., Liu, B., Xu, B.: Accurate Recognition of CIS-regulatory motifs with the Correct Lengths in Prokaryotic Genomes. Nucleic Acids Research 38(2), e12 (2009), http://nar.oxfordjournals.org CrossRefGoogle Scholar
  3. 3.
    Fisher, P.S., Fisher, H., Baek, J., Angaye, C.: Syntactic Pattern Recognition Using Finite Inductive Strings. In: Kadirkamanathan, V., Sanguinetti, G., Girolami, M., Niranjan, M., Noirel, J. (eds.) PRIB 2009. LNCS, vol. 5780, pp. 89–101. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  4. 4.
    Case, J.H., Fisher, P.S.: Long Term Memory Modules. Bulletin of Mathematical Biology 46(2), 295–326 (1984)CrossRefGoogle Scholar
  5. 5.
    Source used for data in this paper, http://www.ncbi.nlm.nih.gov/nuccore/12751174
  6. 6.
    Smith, T.F., Waterman, M.S.: Identification of Common Molecular Subsequences. Journal of Molecular Biology 147, 195–197 (1981)CrossRefPubMedGoogle Scholar
  7. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Elijah Myers
    • 1
  • Paul S. Fisher
    • 1
  • Keith Irwin
    • 1
  • Jinsuk Baek
    • 1
  • Joao Setubal
    • 2
  1. 1.Department of Computer ScienceWinston-Salem State UniversityUSA
  2. 2.Viginia Bioinformatics InstituteVirgina TechBlacksburgUSA

Personalised recommendations