For this project, you will be working on a area of Motif Discovery that is close to a research project. The Project is divided in some set of problems :
[url removed, login to view] a decision problem related to MINIMUM DISCRIMINATING SET COVER
and prove that it is NP-complete.
[url removed, login to view] a decision problem that determines whether MDSC has a feasible solution for some k and j, and prove that this decision problem is NP-complete.
These are sample questions for your understanding. There are 4 more questions which I can forward once the recruiter is finalized.
For your solution, you will write a paper that provides your solutions. Your paper should be written using word processing software such as Microsoft Word or Latex.