Pages that link to "Item:Q935159"
From MaRDI portal
The following pages link to Seeing the trees and their branches in the network is hard (Q935159):
Displaying 36 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)
- On encodings of phylogenetic networks of bounded level (Q455730) (← links)
- Phylogenetic networks that display a tree twice (Q486637) (← links)
- A decomposition theorem and two algorithms for reticulation-visible networks (Q729819) (← links)
- A pattern recognition-based approach for phylogenetic network construction with constrained recombination (Q850133) (← links)
- The compatibility of binary characters on phylogenetic networks: Complexity and parameterized algorithms (Q930588) (← links)
- Identifiability of tree-child phylogenetic networks under a probabilistic recombination-mutation model of evolution (Q1642493) (← links)
- Solving the tree containment problem in linear time for nearly stable phylogenetic networks (Q1647836) (← links)
- Locating a tree in a phylogenetic network (Q1675818) (← links)
- Finding a most parsimonious or likely tree in a network with respect to an alignment (Q1738036) (← 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)
- Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination (Q1775773) (← links)
- When is a phylogenetic network simply an amalgamation of two trees? (Q1990144) (← links)
- Non-essential arcs in phylogenetic networks (Q2136848) (← links)
- Algorithms for visualizing phylogenetic networks (Q2192379) (← links)
- On cherry-picking and network containment (Q2219064) (← links)
- Display sets of normal and tree-child networks (Q2223460) (← links)
- When two trees go to war (Q2261656) (← links)
- Displaying trees across two phylogenetic networks (Q2333792) (← links)
- Fishing for minimum evolution trees with neighbor-nets (Q2350587) (← links)
- A quadratic kernel for computing the hybridization number of multiple trees (Q2450929) (← links)
- A QUBO formulation for the tree containment problem (Q2699952) (← links)
- Locating a Tree in a Phylogenetic Network in Quadratic Time (Q2814579) (← links)
- The Structure of Level-k Phylogenetic Networks (Q3637120) (← links)
- Linear Time Algorithm for Tree-Child Network Containment (Q5041129) (← links)
- Tree Containment With Soft Polytomies (Q5084686) (← links)
- (Q5116473) (← links)
- Topology of viral evolution (Q5171032) (← links)
- On Computing the Maximum Parsimony Score of a Phylogenetic Network (Q5251626) (← links)
- Research in Computational Molecular Biology (Q5706862) (← links)
- Computational Science – ICCS 2005 (Q5709413) (← links)
- Embedding phylogenetic trees in networks of low treewidth (Q6599789) (← links)
