Measurement errors make the partial digest problem NP-hard

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2976, Issue , 2004, Pages 379-390

  Cieliebak, Mark ^a   Eidenbenz, Stephan ^b  

^a ETH ZURICH   (Switzerland)

^b LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY;

DNA MOLECULES; INPUT DATAS; MULTIPLICATIVE FACTORS; PAIRWISE DISTANCES; PARTIAL DIGEST; PARTIAL DIGEST PROBLEMS; PHYSICAL MAPPING; RELATIVE ERRORS;

ERRORS;

EID: 33646035598     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24698-5_42     Document Type: Article

References (20)

1. L. Allison and C. N. Yee. Restriction site mapping is in separation theory. Computer Applications in the Biosciences, 4(1):97-101, 1988.
2. 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):398-404, 2001.
3. rd Workshop on Algorithms in Bioinformatics (WABI 2003), pages 111-123, 2003.
4. T Dakić. On the Turnpike Problem. PhD thesis, Simon Fraser University, 2000.
5. T. I. Dix and D. H. Kieronska. Errors between sites in restriction site mapping. Computer Applications in the Biosciences, 4(1):117-123, 1988.
6. J. Fütterer. Personal communication, 2002. ETH Zurich, Institute of Plant Sciences.
7. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979.
8. J. Inglehart and P. C. Nelson. On the limitations of automated restriction mapping. Computer Applications in the Biosciences, 10(3):249-261, 1994.
9. P. Lemke, S. S. Skiena, and W. Smith. Reconstructing sets from interpoint distances. Technical Report TR2002-37, DIMACS, 2002.
10. n) unlabelled distances between them. Preprint 453, Institute for Mathematics and its Application IMA, 1988.
11. G. Pandurangan and H. Ramesh. The restriction mapping problem revisited. Journal of Computer and System Sciences, 65(3):526-544, 2002. Special issue on Computational Biology.
12. P. A. Pevzner. Computational Molecular Biology: An Algorithmic Approach. MIT Press, 2000.
13. J. Rosenblatt and P. Seymour. The structure of homometric sets. SIAM Journal of Algorithms and Discrete Mathematics, 3(3):343-350, 1982.
14. st International Symposium on Intelligence in Neural and Biological Systems (INBS'95), pages 30-37, 1995.
15. J. Setubal and J. Meidanis. Introduction to Computational Molecular Biology. PWS Boston, 1997.
16. th ACM Symposium on Computational Geometry (SoCG 1990), pages 332-339, 1990.
17. S. S. Skiena and G. Sundaram. A partial digest approach to restriction site mapping. Bulletin of Mathematical Biology, 56:275-294, 1994.
18. P. Tuffery, P. Dessen, C. Mugnier, and S. Hazout. Restriction map construction using a 'complete sentence compatibility' algorithm. Computer Applications in the Biosciences, 4(1):103-110, 1988.
19. M. S. Waterman. Introduction to Computational Biology. Chapman & Hall, 1995.
20. Z. Zhang. An exponential example for a partial digest mapping algorithm. Journal .of Computational Biology, 1(3):235-239, 1994.