UniversityComputingDijkstra's algorithm, BFS and DFS, and DNA reading frames15–20 min
Paths and Genes
Run Dijkstra's algorithm on a weighted graph, compare breadth-first and depth-first visiting orders, translate DNA into protein and find open reading frames.
Notice, currentExplain, nextApply, next
0 points
The experiment opens when it comes into view.
Theory and model assumptions
Run Dijkstra's algorithm on a weighted graph, compare breadth-first and depth-first visiting orders, translate DNA into protein and find open reading frames.
Teacher guidance
University, Algorithms and Bioinformatics
Expected time: 15–20 minutes.