论文信息 - The Enhanced Double Digest Problem for DNA Physical Mapping

The Enhanced Double Digest Problem for DNA Physical Mapping

The double digest problem is a common NP-hard approach to constructing physical maps of DNA sequences. This paper presents a new approach called the enhanced double digest problem. Although this new problem is also NP-hard, it can be solved in linear time in certain theoretically interesting cases.

Ming-Yang Kao | Wing-Kin Sung | Jared Samet

[1] Jerrold R. Griggs,et al. Interval graphs and maps of DNA , 1986 .

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

[3] T. Smith,et al. Mapping the order of DNA restriction fragments. , 1983, Gene.

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

[5] Pavel A. Pevzner. DNA Physical Mapping, Flows in Networks and Minimum Cycles Mean in Graphs , 1992, Mathematical Methods Of Analysis Of Biopolymer Sequences.

[6] Richard M. Karp,et al. Mapping the genome: some combinatorial problems arising in molecular biology , 1993, STOC.

[7] Mark Stefik,et al. Inferring DNA Structures from Segmentation Data , 1978, Artif. Intell..

[8] Pavel A. Pevzner,et al. DNA physical mapping and alternating Eulerian cycles in colored graphs , 1995, Algorithmica.

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

[10] H. Smith,et al. Restriction endonucleases in the analysis and restructuring of dna molecules. , 1975, Annual review of biochemistry.