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
On the equal-subset-sum problem
Information Processing Letters
Regular Article: A Lower Bound on the Number of Solutions to the Probed Partial Digest Problem
Advances in Applied Mathematics
Physical mapping of chromosomes: a combinatorial problem in molecular biology
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
A dynamic programming approach to de novo peptide sequencing via tandem mass spectrometry
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
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
On de novo interpretation of tandem mass spectra for peptide identification
RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
Formal grammars for intermolecular structure
INBS '95 Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95)
Open Combinatorial Problems in computational Molecular Biology
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Algorithms for dna restriction mapping
Algorithms for dna restriction mapping
On the turnpike problem
On the complexity of constructing Golomb Rulers
Discrete Applied Mathematics
De novo sequencing of nonribosomal peptides
RECOMB'08 Proceedings of the 12th annual international conference on Research in computational molecular biology
Multiplex de novo sequencing of peptide antibiotics
RECOMB'11 Proceedings of the 15th Annual international conference on Research in computational molecular biology
| Hi-index | 5.23 |
The Partial Digest problem asks for the coordinates of m points on a line such that the pairwise distances of the points form a given multiset of (m 2) distances. Partial Digest is a well-studied problem with important applications in physical mapping of DNA molecules. Its computational complexity status is open. Input data for Partial Digest from real-life experiments are always prone to error, which suggests to study variations of Partial Digest that take this fact into account. In this paper, we study the computational complexity of Partial Digest variants that model three different error types that can occur in the data: additional distances, missing distances, and erroneous fragment lengths. We show that these variations are NP-hard, hard to approximate, and strongly NP-hard, respectively.