Pages that link to "Item:Q1675818"

The following pages link to Locating a tree in a phylogenetic network (Q1675818):

Displaying 43 items.

• Reticulation-visible networks (Q281904) (← links)
• On determining if tree-based networks contain fixed trees (Q309890) (← links)
• Folding and unfolding phylogenetic trees and networks (Q338372) (← links)
• Do branch lengths help to locate a tree in a phylogenetic network? (Q347040) (← links)
• Phylogenetic networks that display a tree twice (Q486637) (← links)
• Size of a phylogenetic network (Q516840) (← links)
• A decomposition theorem and two algorithms for reticulation-visible networks (Q729819) (← links)
• Seeing the trees and their branches in the network is hard (Q935159) (← links)
• Phylogenetic diversity and biodiversity indices on phylogenetic networks (Q1642832) (← links)
• Solving the tree containment problem in linear time for nearly stable phylogenetic networks (Q1647836) (← links)
• Solving the tree containment problem for reticulation-visible networks in linear time (Q1660112) (← links)
• Finding a most parsimonious or likely tree in a network with respect to an alignment (Q1738036) (← links)
• Attaching leaves and picking cherries to characterise the hybridisation number for a set of phylogenies (Q1738320) (← links)
• Deciding the existence of a cherry-picking sequence is hard on two trees (Q1741507) (← links)
• On unrooted and root-uncertain variants of several well-known phylogenetic network problems (Q1755726) (← links)
• When is a phylogenetic network simply an amalgamation of two trees? (Q1990144) (← links)
• Non-essential arcs in phylogenetic networks (Q2136848) (← links)
• Classes of explicit phylogenetic networks and their biological and mathematical significance (Q2140011) (← links)
• On cherry-picking and network containment (Q2219064) (← links)
• Display sets of normal and tree-child networks (Q2223460) (← links)
• Trinets encode tree-child and level-2 phylogenetic networks (Q2249670) (← links)
• Phylogenetic networks that are their own fold-ups (Q2280359) (← links)
• Displaying trees across two phylogenetic networks (Q2333792) (← links)
• Tree-like reticulation networks -- when do tree-like distances also support reticulate evolution? (Q2343794) (← links)
• Fishing for minimum evolution trees with neighbor-nets (Q2350587) (← links)
• On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters (Q2358415) (← links)
• The rigid hybrid number for two phylogenetic trees (Q2661987) (← links)
• A QUBO formulation for the tree containment problem (Q2699952) (← links)
• Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time (Q2798232) (← links)
• Locating a Tree in a Phylogenetic Network in Quadratic Time (Q2814579) (← links)
• Counting trees in a phylogenetic network is \#P-complete (Q2862211) (← links)
• The SNPR neighbourhood of tree-child networks (Q4585061) (← links)
• Linear Time Algorithm for Tree-Child Network Containment (Q5041129) (← links)
• Tree Containment With Soft Polytomies (Q5084686) (← links)
• (Q5116473) (← links)
• A Structure Theorem for Rooted Binary Phylogenetic Networks and Its Implications for Tree-Based Networks (Q5163512) (← links)
• Treewidth of display graphs: bounds, brambles and applications (Q5233142) (← links)
• On Computing the Maximum Parsimony Score of a Phylogenetic Network (Q5251626) (← links)
• Computational Science – ICCS 2005 (Q5709413) (← links)
• Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks (Q6056548) (← links)
• Embedding phylogenetic trees in networks of low treewidth (Q6599789) (← links)
• Counting Cherry reduction sequences in phylogenetic tree-child networks is counting linear extensions (Q6639832) (← links)
• On the existence of funneled orientations for classes of rooted phylogenetic networks (Q6652436) (← links)