A pattern recognition-based approach for phylogenetic network construction with constrained recombination
From MaRDI portal
(Redirected from Publication:850133)
Recommendations
- Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination
- Seeing the trees and their branches in the network is hard
- Research in Computational Molecular Biology
- The fine structure of galls in phylogenetic networks
- An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study
Cites work
Cited in
(9)- Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination
- Reconstructing tree-child networks from reticulate-edge-deleted subnetworks
- Classes of explicit phylogenetic networks and their biological and mathematical significance
- Bounding the number of hybridisation events for a consistent evolutionary history
- Binary sequences-based approach for construction of evolutionary network
- scientific article; zbMATH DE number 1003279 (Why is no real title available?)
- ReCombinatorics. The algorithmics of ancestral recombination graphs and explicit phylogenetic networks. With contributions from Charles H. Langley, Yun S. Song and Yufeng Wu
- Towards the development of computational tools for evaluating phylogenetic network reconstruction methods
- Reconstructing phylogenetic networks via Cherry picking and machine learning
This page was built for publication: A pattern recognition-based approach for phylogenetic network construction with constrained recombination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q850133)