Solutions for the Genome Assembly Programming Challenge course
- Assembling the phi X174 Genome from Error-Prone Reads Using Overlap Graphs: Perform Genome Assembly on a simulated error-prone sequencing dataset.
-
Puzzle Assembly: Consider a square puzzle consisting of n-by-n square pieces, where each square piece has a single color on each of its four edges.
-
Finding an Eulerian Cycle in Directed Graph: Given a directed graph, find an Eulerian cycle in the graph or report that none exists.
-
Finding a Circulation in a Network: Given a network with lower bounds and capacities on edges, find a circulation if it exists.
-
Selecting the Optimal k-mer Size: Given a list of error-free reads, return an integer k such that, when a de Bruijn graph is created from the k-length fragments of the reads, the de Bruijn graph has a single possible Eulerian Cycle.
- clang
clang++ -std=c++11 -stdlib=libc++ -Weverything file_name.cpp- g++
g++ -pipe -O2 -std=c ++14 file_name.cpp -lm