My research interest are broadly in algorithm design and analysis, and I take inspiration from biological problems. Many times this not only leads to an interesting algorithmic result, but a useful biological tool (see Software).
In the past my work has focused mainly on multiple sequence alignment problems. Most recently I worked on improving accuracy of protein multiple sequence alignments. Multiple sequence alignment is a fundamental step in bioinformatics, but the problem is NP-complete. Because of the importance of the result and complexity of the multiple sequence alignment problem many algorithms exist to find high quality alignments in practice. Each of these algorithms has a large number of tunable parameters that can greatly affect the quality of the computed alignment. Most users rely on the default parameter choices, which produce the best alignments on average, but produce poor alignments for some inputs. We developed a process called parameter advising which selects parameter choices that produces a high quality alignment for the input. To accomplish this candidate alignments are produced using each of the parameter choices in an advising set, the accuracy of these candidate alignments is then estimated using an advising estimator, the candidate alignment with the highest estimated accuracy is then selected for the user. To estimate the alignment accuracy we developed Facet (Feature-based accuracy estimator) which is a linear combination of efficiently-computable feature functions. We have found that learning an optimal advisor (selecting both the estimator coefficients and the set of parameter choices) is NP-complete. We expanded this result to show that finding the estimator coefficients or the estimator set independently is also NP-complete. In practice, we have methods to find close-to optimal advisors. We are working on ways to improve the accuracy of these parameter advisors.
I have also worked on improving the memory consumption of secondary structure conscious RNA multiple sequence alignment (see PMFastR) and high throughput phylogeny filtering (see SiClE).
The work that was done while Fiyinfoluwa Gbosibo was at CMU during the summer of 2017 which was published at ACM-BCB this week won the best student paper award. The paper titled “Practical Universal k-mer Sets for Minimizer Schemes” also has Carl and Guillaume as authors. Congrats Fiyin!
The full paper is available in the BCB proceedings and are open access.
I will be presenting our work on generating universal sets for large k-mers, “Practical universal k-mer sets for minimizer schemes” with Fiyin Gbosibo, Carl Kingsford, and Guillaume Marçais, as a poster at ISMB/ECCB 2019 in Basel in July. The preprint is now available (see Publications).