On the complexity of the DNA simplified partial digest problem

Authors:
Jacek Blazewicz;Marta Kasprzak
Affiliations:
Poznan University of Technology, Poznan;Poznan University of Technology, Poznan
Venue:
CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51
Year:
2006

Citing 10
Cited 0

The NP-completeness column: An ongoing guide

Journal of Algorithms
Mapping DNA by stochastic relaxation

Advances in Applied Mathematics
Reconstructing sets from interpoint distances (extended abstract)

SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Multiple solutions of DNA restriction mapping problems

Advances in Applied Mathematics
Regular Article: A Lower Bound on the Number of Solutions to the Probed Partial Digest Problem

Advances in Applied Mathematics
Algorithms for optical mapping

RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
Geometric reconstruction problems

Handbook of discrete and computational geometry
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The restriction mapping problem revisited

Journal of Computer and System Sciences - Computational biology 2002
Complexity of DNA sequencing by hybridization

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem to be addressed is one of the genome mapping of DNA molecules. The new approach --- the Simplified Partial Digest Problem (SPDP), is analyzed. This approach is easy in laboratory implementation and robust with respect to measurement errors. In the paper, it is formulated in terms of a combinatorial search problem and 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 of restriction sites.