Faster computation of the Robinson–Foulds distance between phylogenetic networks
- 1 August 2012
- journal article
- research article
- Published by Elsevier in Information Sciences
- Vol. 197, 77-90
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Metrics for Phylogenetic Networks I: Generalizations of the Robinson-Foulds MetricIEEE/ACM Transactions on Computational Biology and Bioinformatics, 2008
- Comparison of Tree-Child Phylogenetic NetworksIEEE/ACM Transactions on Computational Biology and Bioinformatics, 2008
- A distance metric for a class of tree-sibling phylogenetic networksBioinformatics, 2008
- Hybrids in Real TimeSystematic Biology, 2006
- Highways of gene sharing in prokaryotesProceedings of the National Academy of Sciences, 2005
- Computing the maximum agreement of phylogenetic networksTheoretical Computer Science, 2005
- Neighbor-Net: An Agglomerative Method for the Construction of Phylogenetic NetworksMolecular Biology and Evolution, 2003
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987
- Optimal algorithms for comparing trees with labeled leavesJournal of Classification, 1985
- A linear algorithm for embedding planar graphs using PQ-treesJournal of Computer and System Sciences, 1985