Pages that link to "Item:Q1781993"
From MaRDI portal
The following pages link to Computing the maximum agreement of phylogenetic networks (Q1781993):
Displaying 22 items.
- Do branch lengths help to locate a tree in a phylogenetic network? (Q347040) (← links)
- Reconstruction of certain phylogenetic networks from their tree-average distances (Q383120) (← links)
- Faster computation of the Robinson-Foulds distance between phylogenetic networks (Q454925) (← links)
- On encodings of phylogenetic networks of bounded level (Q455730) (← links)
- Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets (Q513300) (← links)
- Constructing the simplest possible phylogenetic network from triplets (Q534764) (← links)
- All that glisters is not galled (Q733254) (← links)
- Path lengths in tree-child time consistent hybridization networks (Q845330) (← links)
- Inferring a level-1 phylogenetic network from a dense set of rooted triplets (Q860812) (← links)
- Fast algorithms for computing the tripartition-based distance between phylogenetic networks (Q996826) (← links)
- Novel phylogenetic network distances based on cherry picking (Q2061999) (← links)
- Classes of explicit phylogenetic networks and their biological and mathematical significance (Q2140011) (← links)
- On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters (Q2358415) (← links)
- Encoding and constructing 1-nested phylogenetic networks with trinets (Q2375949) (← links)
- Fast algorithm for the reconciliation of gene trees and LGT networks (Q2400940) (← links)
- Computing the rooted triplet distance between galled trees by counting triangles (Q2442817) (← links)
- Unrooted non-binary tree-based phylogenetic networks (Q2656952) (← links)
- Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time (Q3637119) (← links)
- The Structure of Level-k Phylogenetic Networks (Q3637120) (← links)
- Computing the rooted triplet distance between phylogenetic networks (Q5918288) (← links)
- Computing consensus networks for collections of 1-nested phylogenetic networks (Q6075713) (← links)
- How far is my network from being edge-based? Proximity measures for edge-basedness of unrooted phylogenetic networks (Q6162049) (← links)
