Machine Learning Developer in Singapore, Singapore

While working at the National University of Singapore one of my projects was to create a much efficient representation of the Succinct Colored de Bruijn Graph data structure used for DNA assembly, compression, bubble calling and to detect variations between individuals of a population.

For my Master's thesis, I needed to use an efficient tree labeling algorithm. Because at the time the currently available algorithms were mostly theoretical (without any libraries), I have decided that I give a concrete solution to the problem. First I implemented my algorithm in C++ and then I gave an alternative implementation in Python.

While working on my Ph.D., I was mostly concentrating on problems of Statistical Bioinformatics. One particular problem was how to reconstruct tree graph structures from given frequencies of subgraph information. I gave a concrete algorithm for the rooted directed trees' problem and published my results in a paper.