Universal k-mer sets work accepted to ACM-BCB

Our recent work on universal k-mer sets has been accepted as a paper to The 10th ACM Conference on Bioinformatics, Computational Biology, and Health Informatics (ACM-BCB) in September, being held in Niagara Falls, NY. The work titled “Practical universal k-mer sets for minimizer schemes” is a collaboration with our summer iBRIC student from 2017 Fiyin Gbosibo, Carl Kingsford, and Guillaume Marçais. The preprint is now available (see Publications).

“Locality sensitive hashing for the edit distance” accepted to ISMB/ECCB 2019

Related to the work we presented at ISMB last year, our new work on making a new hashing scheme that improves on Jaccard and Hamming distances for searching large sequences was recently accepted to ISMB/ECCB 2019 in Basel, Switzerland. This is work with Guillaume Marçais, Carl Kingsford, and Prashant Pandey. A preprint of the manuscript is on bioRxiv (see Publications).

ISCB-SC 2018 Symposia Article Published

Our editorial describing the symposia that were hosted by the ISCB Student Council over 2018 calendar year was recently published in F1000 Research. I am proud to say this is the first year I attended 2 out of the 3. While I was not a primary organizer for any of the events, all three were well received and the symposia chairs, the committee members, and all of the attendees are to thank.


With the publication of this article I am also ending my tenure on the ISCB-SC Executive Team, which has been a great experience.

“Asymptotically optimal minimizers schemes” accepted to ISMB

Soon after joining the Kingsford group I began talking with Guillaume Marçais about his work on minimizer schemes. This year I contributed to the most recent publication in this line of work which describes the asymptotic bounds for the densities of these schemes. This work was accepted for presentation at ISMB 2018 in Chicago, IL. A preprint of the manuscript is on bioRxiv (see Publications).