Constructing the R* consensus tree of two trees in subcubic time (Q1950390): Difference between revisions

@@ Property / cites work @@
+Comparing and Aggregating Partially Resolved Trees
+Normal rank
@@ Property / cites work @@
+Q4508365
@@ Property / cites work: Q4508365 / rank @@
+Normal rank
@@ Property / cites work @@
+A structured family of clustering and tree construction methods
+Normal rank
@@ Property / cites work @@
+New results on optimizing rooted triplets consistency
+Normal rank
@@ Property / cites work @@
+Q5417615
@@ Property / cites work: Q5417615 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal algorithms for comparing trees with labeled leaves
+Normal rank
@@ Property / cites work @@
+Algorithms on Strings, Trees and Sequences
@@ Property / cites work: Algorithms on Strings, Trees and Sequences / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Finding Nearest Common Ancestors
+Normal rank
@@ Property / cites work @@
+Constructing the R* Consensus Tree of Two Trees in Subcubic Time
+Normal rank
@@ Property / cites work @@
+Computing the Local Consensus of Trees
@@ Property / cites work: Computing the Local Consensus of Trees / rank @@
+Normal rank
@@ Property / cites work @@
+An improved algorithm for the maximum agreement subtree problem
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank