Faculty mentor: Blair Sullivan
In metagenomics, scientists need to be able to identify and search for micro-organisms in a blend of genetic material. This can be done by constructing dominating sets to partition the graph into small pieces. To reduce the impact of arbitrary tie-breaking in this process, we investigate ways to find dominating sets that have low average congestion. We analyze how well two methods for doing this approximate the optimal solution.
Click below to hear me present my poster!
Questions or comments? Contact me at: email@example.com