Building a Heap

Binary heaps are binary trees that are sorted in such a way that the parent leaf is either greater or lesser than both of its child nodes. When the root node is the greatest and each parent is greater than its children, then it's a max heap. In the opposite scenario, we have a min heap. When presented with an array, we simply line up each element in the array from left to right, top to bottom in a binary tree format. 

Testing graphs for bipartiteness

Graphs are amazing.

de Brujin graphs and Velvet Optimiser

I'm working with the Velvet Assembler as part of my virus identification project. When I'm not trying to write a perl module to complement the already-bulky script files that I'm working with,  I like to do something that I usually wish most other bioinformatics scientists I've met would do as well: I like to delve into the mathematics behind the program.

Suboptimal Alignment Algorithm

Despite the existence of the Lalign program which could find internal duplications between two strings, I've developed my own algorithm for carrying out a similar function as part of this Rosalind problem.


Ever since I got to Ithaca at the Boyce Thompson Institute, I've had to learn how to program in Perl, a  less elegant version of my weapon of choice, Python.

An underscore? Next, you'll be telling me to use goto and watch the world burn.

Any way the wind blows

Dear blog, my source of reflection,

One thing that has occurred to me is that, in order to keep moving ahead in life, you need to routinely ask yourself why you are doing the things you do. For example, I've loved science since I don't even know when, but I never really ask myself why I want to grind my nose in research or go to med school (if I even still want to). Let's face it. I wasn't born with an undying love for what I do. If the high school freshman I once was had seen my bioinformatics research projects that I'm currently doing, I would have gone running for the hills in any direction other than science.