论文信息 - On the complexity of the Double Digest Problem - 字舞流文

On the complexity of the Double Digest Problem

The problem of genome mapping is considered. It is showed that the Double Digest Problem (DDP) is NP-hard in its search version, while its decision version is trivially easy.

Edmund K. Burke | Jacek Blazewicz | Marta Kasprzak | E. Burke | J. Blazewicz | M. Jaroszewski | M. Kasprzak | B. Paliswiat | P. Pryputniewicz | M. Jaroszewski | B. Paliswiat | P. Pryputniewicz

[1] Craig A. Stewart,et al. Introduction to computational biology , 2005 .

[2] M. Garey. Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .

[3] Geoffrey Zweig,et al. Physical mapping of chromosomes using unique probes , 1994, SODA '94.

[4] M. Waterman,et al. Multiple solutions of DNA restriction mapping problems , 1991 .

[5] Warren D. Smith,et al. Reconstructing Sets From Interpoint Distances , 2003 .

[6] P. Seymour,et al. The Structure of Homometric Sets , 1982 .

[7] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8] Jacek Blazewicz,et al. Construction of DNA restriction maps based on a simplified experiment , 2001, Bioinform..

[9] Steven Skiena,et al. A partial digest approach to restriction site mapping , 1993, ISMB.

[10] Susan R. Wilson. INTRODUCTION TO COMPUTATIONAL BIOLOGY: MAPS, SEQUENCES AND GENOMES. , 1996 .

[11] Raymond E. Miller,et al. Complexity of Computer Computations , 1972 .

[12] Michael S. Waterman,et al. Introduction to computational biology , 1995 .

[13] M. Waterman,et al. Mapping DNA by stochastic relaxation , 1987 .