New results on optimizing rooted triplets consistency
Authors:
- Jaroslaw ByrkaJBJaroslaw Byrka
- Sylvain GuillemotSGSylvain Guillemot
- Jesper JanssonJJJesper Jansson
- 1 June 2010
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 158 (11) , 1136-1147
Abstract
No abstract availableKeywords
Funding Information
- Special Coordination Funds for Promoting Science and Technology, Japan
This publication has 24 references indexed in Scilit:
- Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networksJournal of Discrete Algorithms, 2010
- Maximum agreement and compatible supertreesJournal of Discrete Algorithms, 2007
- Hardness of fully dense problemsInformation and Computation, 2007
- Analytic solutions for three taxon ML trees with variable rates across sitesDiscrete Applied Mathematics, 2007
- Inferring a level-1 phylogenetic network from a dense set of rooted tripletsTheoretical Computer Science, 2006
- Algorithmic construction of sets for k -restrictionsACM Transactions on Algorithms, 2006
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivityJournal of the ACM, 2001
- A supertree method for rooted treesDiscrete Applied Mathematics, 2000
- Reconstruction of rooted trees from subtreesDiscrete Applied Mathematics, 1996
- Determining the Evolutionary Tree Using ExperimentsJournal of Algorithms, 1996