Pages that link to "Item:Q2845521"
From MaRDI portal
The following pages link to Computing the maximum agreement of phylogenetic networks (Q2845521):
Displaying 10 items.
- On encodings of phylogenetic networks of bounded level (Q455730) (← links)
- Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species (Q868961) (← links)
- Finding a most parsimonious or likely tree in a network with respect to an alignment (Q1738036) (← links)
- Computing the maximum agreement of phylogenetic networks (Q1781993) (← links)
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (Q2172401) (← links)
- Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks (Q2266938) (← links)
- Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms (Q4376196) (← links)
- Distinguishing Phylogenetic Networks (Q4564014) (← links)
- Algorithms and Computation (Q5712148) (← links)
- Computing consensus networks for collections of 1-nested phylogenetic networks (Q6075713) (← links)
