Displaying similar documents to “On the complexity of the Double Digest Problem”

Combinatorial optimization in DNA mapping — A computational thread of the simplified partial digest problem

Jacek Blazewicz, Marta Kasprzak (2005)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

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 error-free case. For a subproblem of the SPDP, a simple O( n log n )-time algorithm is given, where n is a number...

Mathematical modelling of molecule evolution in protocells

Dariusz Myszor, Krzysztof A. Cyran (2013)

International Journal of Applied Mathematics and Computer Science

Similarity:

In this article, we analyse the process of the emergence of RNA polynucleotides located in an enclosed environment, at an early stage of the RNA world. Therefore we prepared a mathematical model, composed of a set of differential equations, which simulates the behaviour of an early biological system bounded by a protocell membrane. There is evidence that enclosed environments were available on the primordial Earth. There are also experimental proofs that RNA strands can develop in these...