When two trees go to war

DOI10.1016/j.jtbi.2010.10.032zbMath1307.92304arXiv1004.5332OpenAlexW2161063454WikidataQ37806392 ScholiaQ37806392MaRDI QIDQ2261656

Steven Kelk, Leo van Iersel

Publication date: 9 March 2015

Published in: Journal of Theoretical Biology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1004.5332

zbMATH Keywords

clustercharacterphylogenetic networktripletreticulation

Mathematics Subject Classification ID

Problems related to evolution (92D15) Applications of graph theory (05C90)

Related Items (8)

On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters ⋮ Cherry picking: a characterization of the temporal hybridization number for a set of phylogenies ⋮ On the complexity of computing the temporal hybridization number for two phylogenies ⋮ A quadratic kernel for computing the hybridization number of multiple trees ⋮ Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable ⋮ On the fixed parameter tractability of agreement-based phylogenetic distances ⋮ Trinets encode tree-child and level-2 phylogenetic networks ⋮ On Computing the Maximum Parsimony Score of a Phylogenetic Network

Uses Software

• Dendroscope

Cites Work

• Constructing the simplest possible phylogenetic network from triplets
• Inferring a level-1 phylogenetic network from a dense set of rooted triplets
• An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study
• Computing the minimum number of hybridization events for a consistent evolutionary history
• Seeing the trees and their branches in the network is hard
• Optimizing phylogenetic diversity across two trees
• A new recombination lower bound and the minimum perfect phylogenetic forest problem
• Bounding the number of hybridisation events for a consistent evolutionary history
• Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time
• Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network
• Research in Computational Molecular Biology
• The asymmetric median tree. --- A new model for building consensus trees

This page was built for publication: When two trees go to war