delafont/Genomics-and-bioinformatics — comment on commit 17c4c5d1e1d0cecdd69d9b01c710857a53483675
File:  line 0
By delafont:

1. It is not what the exercise sheet said to students ("create the graph and use this code to search for an Hamiltonian path, and deduce the contig").
2. It is obvious that trying to get the Bible trying all the permutations of its letters is slow. There is no biology here, it has no link with the course, and it is slower than every other algorithm, so it doesn't show the interest of either of our methods. Or create an exercise 0, and compare with the time to find the Hamiltonian path, which we haven't.
3. The goal of the exercise is to show why they have to understand something as complicated as the dual graph, if the first graph already gives a solution. So one needs to compare the time to find an hamiltonian path in the first and an eulerian cycle in the second. There is no fast algorithm to solve the first one, so it would work anyway.
4 One shouldn't add reads2.txt because in case of triple alignments, it requires a lot of work from the students to remove duplicated fragments in Sl.