Question 6
The de Bruijn graph of some linear (i.e., non-circular) genome Dna comprises of 2 nodes (N1 and N2) and 3 edges – two of these edges are directed from N1 to N2 and the remaining edge is directed from N2 to N1. To reconstruct Dna, you are allowed to start only from the node N1. Answer the given subquestions with respect to the same.
If the k-mers represented by both N1 and N2 are fixed, then how many unique genome sequences can be constructed from this de Bruijn graph? Enter the answer as a single integer.