Locating a tree in a phylogenetic network
From MaRDI portal
Publication:1675818
DOI10.1016/j.ipl.2010.07.027zbMath1379.68184OpenAlexW2005892692MaRDI QIDQ1675818
Leo van Iersel, Charles Semple, Mike A. Steel
Publication date: 3 November 2017
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.2383
Analysis of algorithms and problem complexity (68Q25) Problems related to evolution (92D15) Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (35)
On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters ⋮ Reticulation-visible networks ⋮ Linear Time Algorithm for Tree-Child Network Containment ⋮ Non-essential arcs in phylogenetic networks ⋮ Classes of explicit phylogenetic networks and their biological and mathematical significance ⋮ On determining if tree-based networks contain fixed trees ⋮ Phylogenetic diversity and biodiversity indices on phylogenetic networks ⋮ Solving the tree containment problem in linear time for nearly stable phylogenetic networks ⋮ Folding and unfolding phylogenetic trees and networks ⋮ Do branch lengths help to locate a tree in a phylogenetic network? ⋮ Tree Containment With Soft Polytomies ⋮ The rigid hybrid number for two phylogenetic trees ⋮ The SNPR neighbourhood of tree-child networks ⋮ Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks ⋮ A QUBO formulation for the tree containment problem ⋮ On cherry-picking and network containment ⋮ Display sets of normal and tree-child networks ⋮ Phylogenetic networks that display a tree twice ⋮ Finding a most parsimonious or likely tree in a network with respect to an alignment ⋮ Attaching leaves and picking cherries to characterise the hybridisation number for a set of phylogenies ⋮ Deciding the existence of a cherry-picking sequence is hard on two trees ⋮ When is a phylogenetic network simply an amalgamation of two trees? ⋮ Size of a phylogenetic network ⋮ Trinets encode tree-child and level-2 phylogenetic networks ⋮ A Structure Theorem for Rooted Binary Phylogenetic Networks and Its Implications for Tree-Based Networks ⋮ On unrooted and root-uncertain variants of several well-known phylogenetic network problems ⋮ Phylogenetic networks that are their own fold-ups ⋮ A decomposition theorem and two algorithms for reticulation-visible networks ⋮ Unnamed Item ⋮ Locating a Tree in a Phylogenetic Network in Quadratic Time ⋮ Treewidth of display graphs: bounds, brambles and applications ⋮ Displaying trees across two phylogenetic networks ⋮ On Computing the Maximum Parsimony Score of a Phylogenetic Network ⋮ Tree-like reticulation networks -- when do tree-like distances also support reticulate evolution? ⋮ Fishing for minimum evolution trees with neighbor-nets
Uses Software
Cites Work
This page was built for publication: Locating a tree in a phylogenetic network
