Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: In the paper, the problem of the genome mapping of DNA molecules, is presented. In particular, the new approach - the Simplified Partial Digest Problem (SPDP), is analyzed. This approach, although easy in laboratory implementation and robust with respect to measurement errors, when formulated in terms of a combinatorial search problem, is proved to be strongly NP-hard for the general errorfree case. For a subproblem of the SPDP, a simple O(n log n)-time algorithm is given, where n is a number of restriction sites.
['Jacek Blazewicz', 'Marta Kasprzak']
I am writing a research paper on a idea Combinatorial optimization in DNA mapping — a computational thread of the Simplified Partial Digest Problem
[{"from": "human", "value": "I am writing a research paper on a idea Combinatorial optimization in DNA mapping \u2014 a computational thread of the Simplified Partial Digest Problem"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: In the paper, the problem of the genome mapping of DNA molecules, is presented. In particular, the new approach - the Simplified Partial Digest Problem (SPDP), is analyzed. This approach, although easy in laboratory implementation and robust with respect to measurement errors, when formulated in terms of a combinatorial search problem, is proved to be strongly NP-hard for the general errorfree case. For a subproblem of the SPDP, a simple O(n log n)-time algorithm is given, where n is a number of restriction sites."}]