Phylogenetic Networks: Modeling, Reconstructibility, and Accuracy
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Computing the minimum number of hybridization events for a consistent evolutionary history
Discrete Applied Mathematics
Comparison of Tree-Child Phylogenetic Networks
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Phylogenetic networks do not need to be complex
Bioinformatics
Bioinformatics
| Hi-index | 0.04 |
Phylogenetic networks are now frequently used to explain the evolutionary history of a set of species for which a collection of gene trees, reconstructed from genetic material of different parts of the species' genomes, reveal inconsistencies. However, in the context of hybridization, the reconstructed networks are often not temporal. If a hybridization network is temporal, then it satisfies the time constraint of instantaneously occurring hybridization events; i.e. all species that are involved in such an event coexist in time. Furthermore, although a collection of phylogenetic trees can often be merged into a hybridization network that is temporal, many algorithms do not necessarily find such a network since their primary optimization objective is to minimize the number of hybridization events. In this paper, we present a characterization for when two rooted binary phylogenetic trees admit a temporal hybridization network. Furthermore, we show that the underlying optimization problem is APX-hard and, therefore, NP-hard. Thus, unless P=NP, it is unlikely that there are efficient algorithms for either computing an exact solution or approximating it within a ratio arbitrarily close to one.