Introduction We study the problem of genome mapping using restriction site analysis. In restriction site analysis, an enzyme cuts a target DNA strand into DNA fragments, and these DNA fragments are used to reconstruct the restriction site locations of the enzyme. Two common approaches are the Double Digest Problem and the Partial Digest Problem. The Double Digest Problem is known to be NP-Compl...

Two algorithms are described that rapidly construct restriction maps of DNA molecules from single- and double-digest data. The implementation of these algorithms into the Pascal programs AMAPK and AMARD allows such mapping to be done on microcomputers.

As mentioned before, we have two approaches for physical mapping: Restriction mapping and mapping by hybridization. We covered restriction mapping previously through the two problems of double digest and partial digest. We now look at mapping by hybridization. While restriction mapping involves the mapping of restriction sites (precise short sequences) of a cutting enzyme based on the lengths o...

The results presented in this paper were motivated by a study of certain patterns, known as restriction sites, in DNA sequences. DNA sequences can be thought of as finite words over a four-letter alphabet {A, T, G, C}, and restriction sites are (sequence-specific) locations of positions in double-stranded DNA where it is cut by a protein known as a restriction enzyme. See Watson (1977). For exa...