Partial Digest is hard to solve for erroneous input data

Theoretical Computer Science

Volumn 349, Issue 3, 2005, Pages 361-381

  Cieliebak, Mark ^a   Eidenbenz, Stephan ^b   Penna, Paolo ^c  

^a ETH ZURICH   (Switzerland)

^b LOS ALAMOS NATIONAL LABORATORY   (United States)

^c UNIVERSITY OF SALERNO   (Italy)

Author keywords

Partial Digest; Physical DNA mapping; Point reconstruction; Turnpike problem

Indexed keywords

DATA REDUCTION; DNA; ERROR ANALYSIS; MOLECULES; SET THEORY;

PARTIAL DIGEST; PHYSICAL DNA MAPPING; POINT RECONSTRUCTION; TURNPIKE PROBLEM;

PROBLEM SOLVING;

EID: 27844524537     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.08.030     Document Type: Article

References (35)

1. F. Alizadeh, R.M. Karp, L.A. Newberg, D.K. Weisser, Physical mapping of chromosomes: a combinatorial problem in molecular biology, in: Proc. of the Fourth SIAM-ACM Symp. on Discrete Algorithms (SODA 1993), 1993, pp. 371-381.
2. L. Allison, and C.N. Yee Restriction site mapping is in separation theory Comput. Appl. Biosci. 4 1 1988 97 101
3. V. Bafna, N. Edwards, On de novo interpretation of tandem mass spectra for peptide identification, in: Proc. of the Seventh Annu. Internat. Conf. on Computational Biology (RECOMB 03), 2003, pp. 9-18.
4. S. Baginsky, Personal Communication, ETH Zurich, Institute of Plant Sciences, 2003.
5. J. Błazewicz, P. Formanowicz, M. Kasprzak, M. Jaroszewski, and W.T. Markiewicz Construction of DNA restriction maps based on a simplified experiment Bioinformatics 17 5 2001 398 404
6. T. Chen, M.-Y. Kao, M. Tepel, J. Rush, G.M. Church, A dynamic programming approach to de novo peptide sequencing via tandem mass spectrometry, in: Proc. of the 11th SIAM-ACM Symp. on Discrete Algorithms (SODA 2000), 2000, pp. 389-398.
7. J. Błazewicz, P. Formanowicz, M. Kasprzak, M. Jaroszewski, and W.T. Markiewicz Construction of DNA restriction maps based on a simplified experiment Bioinformatics 17 5 2001 398 404
8. M. Cieliebak, S. Eidenbenz, P. Penna, Noisy data make the partial digest problem NP-hard, Technical Report 381, ETH Zurich, Department of Computer Science, 2002.
9. M. Cieliebak, S. Eidenbenz, P. Penna, Noisy data make the partial digest problem NP-hard, in: Proc. of the Third Workshop on Algorithms in Bioinformatics (WABI 2003), 2003, pp. 111-123.
10. T. Dakić, On the turnpike problem, Ph.D. Thesis, Simon Fraser University, 2000.
11. T.I. Dix, and D.H. Kieronska Errors between sites in restriction site mapping Comput. Appl. Biosci. 4 1 1988 117 123
12. D. Fasulo, Algorithms for DNA restriction mapping, Ph.D. Thesis, University of Washington, 2000.
13. J. Fütterer, Personal Communication, ETH Zurich, Institute of Plant Sciences, 2002.
14. M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 Freeman New York
15. L. Goldstein, and M.S. Waterman Mapping DNA by stochastic relaxation Adv. in Appl. Math. 8 1987 194 207
16. J. Håstad Clique is hard to approximate within n 1 - ε Acta Mathematica 182 1999 105 142
17. J. Inglehart, and P.C. Nelson On the limitations of automated restriction mapping Comput. Appl. Biosci. 10 3 1994 249 261
18. P. James (Ed.), Proteome Research: Mass Spectrometry, Springer, Berlin, 2001.
19. P. Lemke, S.S. Skiena, W. Smith, Reconstructing sets from interpoint distances, Technical Report TR2002-37, DIMACS, 2002.
20. P. Lemke, M. Werman, On the complexity of inverting the autocorrelation function of a finite integer sequence, and the problem of locating n points on a line, given the n 2 unlabelled distances between them, Preprint 453, Institute for Mathematics and its Application IMA, 1988.
21. E.W. Mayr, H.J. Prömel, and A. Steger Lectures on Proof Verification and Approximation Algorithms 1998 Springer Berlin
22. L. Newberg, and D. Naor A lower bound on the number of solutions to the probed partial digest problem Adv. in Appl. Math. 14 1993 172 183
23. G. Pandurangan, and H. Ramesh The restriction mapping problem revisited J. Comput. System Sci. 65 3 2002 526 544 special issue on Computational Biology
24. P.A. Pevzner Computational Molecular Biology: An Algorithmic Approach 2000 MIT Press Cambridge, MA
25. P.A. Pevzner, M.S. Waterman, Open combinatorial problems in computational molecular biology, in: Proc. of the Third Israel Symp. on Theory of Computing and Systems (ISTCS 1995), 1995, pp. 158-173.
26. J. Rosenblatt, and P. Seymour The structure of homometric sets SIAM J. Algorithms Discrete Math. 3 3 1982 343 350
27. D.B. Searls, Formal grammars for intermolecular structure, in: Proc. of the First Internat. Symp. on Intelligence in Neural and Biological Systems (INBS'95), 1995, pp. 30-37.
28. J. Setubal, and J. Meidanis Introduction to Computational Molecular Biology 1997 PWS Boston, MA
29. S.S. Skiena, W. Smith, P. Lemke, Reconstructing sets from interpoint distances, in: Proc. of the Sixth ACM Symp. on Computational Geometry (SoCG 1990), 1990, pp. 332-339.
30. S.S. Skiena, and G. Sundaram A partial digest approach to restriction site mapping Bull. Math. Biol. 56 1994 275 294
31. P. Tuffery, P. Dessen, C. Mugnier, and S. Hazout Restriction map construction using a 'complete sentence compatibility' algorithm Comput. Appl. Biosci. 4 1 1988 103 110
32. M.S. Waterman Introduction to Computational Biology 1995 Chapman & Hall New York
33. G.J. Woeginger, and Z.L. Yu On the equal-subset-sum problem Inform. Process. Lett. 42 1992 299 302
34. L.W. Wright, J.B. Lichter, J. Reinitz, M.A. Shifman, K.K. Kidd, and P.L. Miller Computer-assisted restriction mapping: an integrated approach to handling experimental uncertainty Comput. Appl. Biosci. 10 4 1994 435 442
35. Z. Zhang An exponential example for a partial digest mapping algorithm J. Comput. Biol. 1 3 1994 235 239