Volume 39, Number 4, October-December 2005
|Page(s)||227 - 241|
|Published online||08 April 2006|
Combinatorial optimization in DNA mapping — a computational thread of the Simplified Partial Digest Problem
Institute of Computing Science, Poznan University of
Technology, Piotrowo 3A, 60–965 Poznan, Poland; firstname.lastname@example.org
2 Institute of Bioorganic Chemistry, Polish Academy of Sciences, Poznan, Poland; email@example.com
Accepted: 28 October 2005
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(nlogn)-time algorithm is given, where n is a number of restriction sites.
Key words: Combinatorial optimization / DNA restriction mapping / partial digest / computational complexity.
© EDP Sciences, 2006
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.