-
Chapter and Conference Paper
Heuristics for the Gene-Duplication Problem: A Θ(n) Speed-Up for the Local Search
The gene-duplication problem is to infer a species supertree from a collection of gene trees that are confounded by complex histories of gene duplications. This problem is NP-hard and thus requires efficient a...
-
Article
Open AccessiGTP: A software package for large-scale gene tree parsimony analysis
The ever-increasing wealth of genomic sequence information provides an unprecedented opportunity for large-scale phylogenetic analysis. However, species phylogeny inference is obfuscated by incongruence among ...
-
Chapter and Conference Paper
Algorithms for Knowledge-Enhanced Supertrees
Supertree algorithms combine smaller phylogenetic trees into a single, comprehensive phylogeny, or supertree. Most supertree problems are NP-hard, and often heuristics identify supertrees with anomalous or unw...