When two trees go to war (Q2261656): Difference between revisions

@@ Property / Wikidata QID @@
+Q37806392
@@ Property / Wikidata QID: Q37806392 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounding the number of hybridisation events for a consistent evolutionary history
+Normal rank
@@ Property / cites work @@
+Computing the minimum number of hybridization events for a consistent evolutionary history
+Normal rank
@@ Property / cites work @@
+Optimizing phylogenetic diversity across two trees
+Normal rank
@@ Property / cites work @@
+An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study
+Normal rank
@@ Property / cites work @@
+Research in Computational Molecular Biology
@@ Property / cites work: Research in Computational Molecular Biology / rank @@
+Normal rank
@@ Property / cites work @@
+Inferring a level-1 phylogenetic network from a dense set of rooted triplets
+Normal rank
@@ Property / cites work @@
+Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network
+Normal rank
@@ Property / cites work @@
+Seeing the trees and their branches in the network is hard
+Normal rank
@@ Property / cites work @@
+The asymmetric median tree. --- A new model for building consensus trees
+Normal rank
@@ Property / cites work @@
+Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time
+Normal rank
@@ Property / cites work @@
+Constructing the simplest possible phylogenetic network from triplets
+Normal rank
@@ Property / cites work @@
+A new recombination lower bound and the minimum perfect phylogenetic forest problem
+Normal rank