Do branch lengths help to locate a tree in a phylogenetic network?

DOI10.1007/s11538-016-0199-4zbMath1352.92103arXiv1607.06285OpenAlexW2496112388WikidataQ39361059 ScholiaQ39361059MaRDI QIDQ347040

Fabio Pardi, Celine Scornavacca, Philippe Gambette, Leo van Iersel, Steven Kelk

Publication date: 30 November 2016

Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)

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

zbMATH Keywords

computational complexityphylogenetic networkbranch lengthsdisplayed treestree containment

Mathematics Subject Classification ID

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

Related Items

On the complexity of optimising variants of phylogenetic diversity on phylogenetic networks ⋮ Counting phylogenetic networks of level 1 and 2 ⋮ When is a phylogenetic network simply an amalgamation of two trees?

Uses Software

• PhyloNetwork

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances
• Fundamentals of parameterized complexity
• Phylogenetic networks that display a tree twice
• Detecting hybrid speciation in the presence of incomplete lineage sorting using gene tree incongruence: a model
• Inferring a level-1 phylogenetic network from a dense set of rooted triplets
• Seeing the trees and their branches in the network is hard
• Locating a tree in a phylogenetic network
• Computing the maximum agreement of phylogenetic networks
• Trinets encode tree-child and level-2 phylogenetic networks
• The Structure of Level-k Phylogenetic Networks
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• Tree Compatibility and Inferring Evolutionary History
• Mathematical Foundations of Computer Science 2005