The Complexity and Application of Syntactic Pattern Recognition Using Finite Inductive Strings Authors: Elijah Myers, Paul S. Fisher, Keith Irwin, Jinsuk Baek, Joao Setubal Keywords: Pattern Recognition, finite induction, syntactic pattern recognition, algorithm complexity
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.
Pattern matching is of obvious important for bioinformatics and in topic map terms, recognizing subjects.
Questions:
- What “new problems continue to emerge” that you would use pattern matching to solve? (discussion)
- What about those problems makes them suitable for the application of pattern matching? (3-5 pages, no citations)
- What about those problems makes them suitable for the particular techniques described in this paper? (3-5 pages, no citations)