Equivalence classes for the double-digest problem with coincident cut sites.
When restriction sites are modeled by a random process, the number of solutions to the double-digest problem (DDP) increases exponentially with the length of the DNA molecule. Cassette transformations define equivalence classes on the set of solutions to the DDP for the case of no coincident cut sites. Pevzner (1994) completely characterized the solutions to the DDP in the case of no coincident cut sites by associating solutions to DDP with alternating Eulerian paths in an edge-bicolored graph. In this paper we extend the definition of cassettes and their transformations to the general case allowing coincident cut sites. Solutions to the DDP in the general case are again characterized by associating solutions to the DDP with alternating Eulerian cycles in an extended graph.
Martin
D R
DR
Department of Mathematics, University of Southern California, Los Angeles 90089-1113, USA.
D008433:Mathematics; D008962:Models, Theoretical; D015183:Restriction Mapping