Pages that link to "Item:Q2890447"
From MaRDI portal
The following pages link to The fine structure of galls in phylogenetic networks (Q2890447):
Displaying 29 items.
- Restricted trees: simplifying networks with bottlenecks (Q263741) (← links)
- Faster computation of the Robinson-Foulds distance between phylogenetic networks (Q454925) (← links)
- Comparing and simplifying distinct-cluster phylogenetic networks (Q505705) (← links)
- Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets (Q513300) (← links)
- All that glisters is not galled (Q733254) (← links)
- Unique reconstruction of tree-like phylogenetic networks from distances between leaves (Q743846) (← links)
- Path lengths in tree-child time consistent hybridization networks (Q845330) (← links)
- A pattern recognition-based approach for phylogenetic network construction with constrained recombination (Q850133) (← links)
- An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study (Q876478) (← links)
- Seeing the trees and their branches in the network is hard (Q935159) (← links)
- Two novel closure rules for constructing phylogenetic super-networks (Q954295) (← links)
- Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination (Q1775773) (← links)
- Reconstruction of certain phylogenetic networks from the genomes at their leaves (Q1794477) (← links)
- Classes of explicit phylogenetic networks and their biological and mathematical significance (Q2140011) (← links)
- The Sackin index of simplex networks (Q2163945) (← links)
- Counting and enumerating galled networks (Q2192120) (← links)
- Counting and enumerating tree-child networks and their subclasses (Q2194860) (← links)
- On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters (Q2358415) (← links)
- Unique determination of some homoplasies at hybridization events (Q2426327) (← links)
- Reconstruction of some hybrid phylogenetic networks with homoplasies from distances (Q2426378) (← links)
- Tripartitions do not always discriminate phylogenetic networks (Q2476109) (← links)
- Phylogenetic networks from multi-labelled trees (Q2500119) (← links)
- ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations (Q3506937) (← links)
- Haplotype Inferring Via Galled-Tree Networks Is NP-Complete (Q3511338) (← links)
- Parallel Algorithm for Conflict Graph on OTIS-Triangular Array (Q5445764) (← links)
- Clustered SplitsNetworks (Q5505684) (← links)
- Research in Computational Molecular Biology (Q5706862) (← links)
- Enumeration of rooted binary unlabeled galled trees (Q6124365) (← links)
- How far is my network from being edge-based? Proximity measures for edge-basedness of unrooted phylogenetic networks (Q6162049) (← links)
