Towards the development of computational tools for evaluating phylogenetic network reconstruction methods
From MaRDI portal
Publication:5456778
Recommendations
- A pattern recognition-based approach for phylogenetic network construction with constrained recombination
- Combinatorial scoring of phylogenetic networks
- Algorithms for phylogeny reconstruction in a new mathematical model
- scientific article; zbMATH DE number 1945177
- scientific article; zbMATH DE number 1303534
Cited in
(13)- Computing the maximum agreement of phylogenetic networks
- Phylogenetic networks from multi-labelled trees
- Path lengths in tree-child time consistent hybridization networks
- scientific article; zbMATH DE number 2013442 (Why is no real title available?)
- Fast algorithms for the rooted triplet distance between caterpillars
- Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks
- Computing the rooted triplet distance between phylogenetic networks
- Fast algorithms for computing the tripartition-based distance between phylogenetic networks
- Computing consensus networks for collections of 1-nested phylogenetic networks
- Tripartitions do not always discriminate phylogenetic networks
- Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination
- An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study
- Inferring a level-1 phylogenetic network from a dense set of rooted triplets
This page was built for publication: Towards the development of computational tools for evaluating phylogenetic network reconstruction methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5456778)
