Computing the minimum number of hybridization events for a consistent evolutionary history
Discrete Applied Mathematics
Computing the Hybridization Number of Two Phylogenetic Trees Is Fixed-Parameter Tractable
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Parameterized Complexity
On the Elusiveness of Clusters
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Fast computation of the exact hybridization number of two phylogenetic trees
ISBRA'10 Proceedings of the 6th international conference on Bioinformatics Research and Applications
A quadratic kernel for computing the hybridization number of multiple trees
Information Processing Letters
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
| Hi-index | 0.00 |
Reticulate evolution—the umbrella term for processes like hybridization, horizontal gene transfer, and recombination—plays an important role in the history of life of many species. Although the occurrence of such events is widely accepted, approaches to calculate the extent to which reticulation has influenced evolution are relatively rare. In this paper, we show that the NP-hard problem of calculating the minimum number of reticulation events for two (arbitrary) rooted phylogenetic trees parameterized by this minimum number is fixed-parameter tractable.