Investigating Some Sequence-based Computational Problems and Applications

Proceso L. Fernandez, Jr., PhD
Department of Information Systems and Computer Science

In this project, we will continue to investigate theoretical solutions to variants of two NP-Hard computing problems:

  1. Consensus Patterns Problem (aka Motif Finding Problem)
  2. Poset Cover

The formal definitions of the above problems will be described more completely in the papers that will be submitted for publication.

We will also explore possible applications of the above problems and/or other sequence-based structures, including those involving images, audio, video, and/ or language processing. We hope to produce commercializable innovation(s) from solutions to such application(s).

Leave a Reply

Your email address will not be published. Required fields are marked *