Advanced Algorithms topics solutions presented in Technical Report

This project was successfully completed by kabukii919 for $80 USD in 10 days.

Get free quotes for a project like this
Project Budget
$50 - $100 USD
Completed In
10 days
Total Bids
Project Description

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.

Completed by:
Skills Required

Looking to make some money?

  • Set your budget and the timeframe
  • Outline your proposal
  • Get paid for your work

Hire Freelancers who also bid on this project

    • Forbes
    • The New York Times
    • Time
    • Wall Street Journal
    • Times Online