Tree Compatibility and Inferring Evolutionary History
From MaRDI portal
Recommendations
Cited in
(24)- Convex tree realizations of partitions
- Coalescent histories for discordant gene trees and species trees
- Polynomial-time algorithms for phylogenetic inference problems
- Fast compatibility testing for phylogenies with nested taxa
- Extension operations on sets of leaf-labelled trees
- Tree compatibility, incomplete directed perfect phylogeny, and dynamic graph connectivity: an experimental study
- On the ancestral compatibility of two phylogenetic trees with nested taxa
- From constrained to unconstrained maximum agreement subtree in linear time
- A novel insight into the perfect phylogeny problem
- Efficient merging and construction of evolutionary trees
- scientific article; zbMATH DE number 437563 (Why is no real title available?)
- Compatibility, incompatibility, tree-width, and forbidden phylogenetic minors
- scientific article; zbMATH DE number 5003290 (Why is no real title available?)
- Do branch lengths help to locate a tree in a phylogenetic network?
- Inferring Evolutionary History From DNA Sequences
- Determining the Evolutionary Tree Using Experiments
- Parsimonious migration history problem: complexity and algorithms
- On the Generalised Character Compatibility Problem for Non-branching Character Trees
- Fast compatibility testing for rooted phylogenetic trees
- Efficient algorithms for inferring evolutionary trees
- On the complexity of comparing evolutionary trees
- The asymmetric median tree. --- A new model for building consensus trees
- Inferring temporally consistent migration histories
- A constructive algorithm for realizing a distance matrix
This page was built for publication: Tree Compatibility and Inferring Evolutionary History
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4290914)
