.In two alternative assemblies of a genomic segment
containing four repeated sequences are diagrammed graphically.
a. For this example, calculate the total number of possible assemblies consistent
with the sequence reads.
b. For the case in which reads from all of the unique regions are included,
the assembly can be described as a Hamiltonian path problem. Diagram
all possible assemblies that begin at a and end at d.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here