Publications

(2020). An MS in CS for non-CS Majors: Moving to Increase Diversity of Thought and Demographics in CS. Proceedings of the 51st ACM Technical Symposium on Computer Science Education.

PDF

(2017). Fast algorithms for computing phylogenetic divergence time. BMC Bioinformatics.

PDF

(2015). Synthesis of phylogeny and taxonomy into a comprehensive tree of life. Proceedings of the National Academy of Sciences.

PDF

(2014). Leveraging programming difficulty to improve understanding and perceptions of non-majors. Journal of Computing Sciences in Colleges.

PDF

(2012). A fast algorithm for computing the quartet distance for large sets of evolutionary trees. International Symposium on Bioinformatics Research and Applications.

PDF

(2011). Paper mâché: Creating dynamic reproducible science. Procedia Computer Science.

PDF

(2011). Impacts of the Cretaceous Terrestrial Revolution and KPg extinction on mammal diversification. Science.

PDF

(2011). An efficient and extensible approach for compressing phylogenetic trees. BMC Bioinformatics.

PDF

(2010). Using decision trees to study the convergence of phylogenetic analyses. 2010 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology.

PDF

(2010). MrsRF: an efficient MapReduce algorithm for analyzing large collections of evolutionary trees. BMC Bioinformatics.

PDF

(2010). Large-scale analysis of phylogenetic search behavior. Advances in Computational Biology.

PDF

(2010). A novel approach for compressing phylogenetic trees. International Symposium on Bioinformatics Research and Applications.

PDF

(2009). Using tree diversity to compare phylogenetic heuristics. BMC Bioinformatics.

PDF

(2009). An experimental analysis of consensus tree algorithms for large-scale tree collections. International Symposium on Bioinformatics Research and Applications.

PDF

(2009). A Fitness Distance Correlation Measure for Evolutionary Trees. International Conference on Bioinformatics and Computational Biology.

PDF

(2008). New approaches to compare phylogenetic search heuristics. 2008 IEEE International Conference on Bioinformatics and Biomedicine.

PDF

(2008). Efficiently computing arbitrarily-sized Robinson-Foulds distance matrices. International Workshop on Algorithms in Bioinformatics.

PDF

(2008). An experimental analysis of robinson-foulds distance matrix algorithms. European Symposium on Algorithms.

PDF

(2007). A randomized algorithm for comparing sets of phylogenetic trees. Proceedings Of The 5th Asia-Pacific Bioinformatics Conference.

PDF DOI

(2006). The role of diverse populations in phylogenetic analysis. Proceedings of the 8th annual conference on Genetic and evolutionary computation.

PDF

(2006). High-Performance Phylogeny Reconstruction Under Maximum Parsimony. Parallel Computing for Bioinformatics and Computational Biology.

DOI

(2004). Rec-I-DCM3: a fast algorithmic technique for reconstructing phylogenetic trees. Proceedings - 2004 IEEE Computational Systems Bioinformatics Conference.

PDF DOI

(2004). Performance of supertree methods on various data set decompositions. Phylogenetic Supertrees.

PDF DOI

(2003). An investigation of phylogenetic likelihood methods. Third IEEE Symposium on Bioinformatics and Bioengineering, 2003. Proceedings..

PDF DOI

(2001). Exploiting Hierarchy in Heterogeneous Environments.. Workshop on Advances in Parallel and Distributed Computational Models (APDCM’01) in conjunction with the 15th International Parallel and Distributed Processing Symposium (IPDPS’01).

PDF DOI