An Introduction to Bioinformatics Algorithms www.bioalgorithms.info Partial Restriction Digest • The sample of DNA is exposed to the restriction enzyme for only a limited amount of time to prevent it from being cut at all restriction sites • This experiment generates the set of all possible restriction fragments between every two (not necessarily consecutive) cuts • This set of fragment sizes is used to determine the positions of the restriction sites in the DNA sequence

An Introduction to Bioinformatics Algorithms www.bioalgorithms.info Multiset of Restriction Fragments • We assume that multiplicity of a fragment can be detected, i.e., the number of restriction fragments of the same length can be determined (e.g., by observing twice as much fluorescence intensity for a double fragment than for a single fragment) Multiset : {3, 5, 5 , 8, 9, 14, 14 , 17, 19, 22}

An Introduction to Bioinformatics Algorithms www.bioalgorithms.info Partial Digest Fundamentals the set of n integers representing the location of all cuts in the restriction map, including the start and end the multiset of integers representing lengths of each of the fragments produced from a partial digest the total number of cuts X : n : D X :

This preview
has intentionally blurred sections.
Sign up to view the full version.