On the complexity of computing the temporal hybridization number for two phylogenies
- 1 May 2013
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 161 (7-8) , 871-880
Abstract
No abstract availableKeywords
Funding Information
- New Zealand Marsden Fund
- German Academic Exchange Service (DAAD)
- New Zealand Marsden Fund
- Allan Wilson Centre for Molecular Ecology and Evolution
This publication has 14 references indexed in Scilit:
- Fast computation of minimum hybridization networksBioinformatics, 2011
- Quantifying Hybridization in Realistic TimeJournal of Computational Biology, 2011
- HybridNET: a tool for constructing hybridization networksBioinformatics, 2010
- Phylogenetic networks do not need to be complex: using fewer reticulations to represent conflicting clustersBioinformatics, 2010
- Analyzing and reconstructing reticulation networks under timing constraintsJournal of Mathematical Biology, 2009
- Constructing the Simplest Possible Phylogenetic Network from TripletsAlgorithmica, 2009
- Computing the minimum number of hybridization events for a consistent evolutionary historyDiscrete Applied Mathematics, 2007
- Phylogenetic networks: modeling, reconstructibility, and accuracyIEEE/ACM Transactions on Computational Biology and Bioinformatics, 2004
- Gene Trees in Species TreesSystematic Biology, 1997
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991