New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem (Q3503579): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-79723-4_8
+Normal rank
@@ Property / OpenAlex ID @@
+W1580410239
@@ Property / OpenAlex ID: W1580410239 / rank @@
+Normal rank
@@ Property / cites work @@
+Reconstructing the shape of a tree from observed dissimilarity data
+Normal rank
@@ Property / cites work @@
+Q4938781
@@ Property / cites work: Q4938781 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4247678
@@ Property / cites work: Q4247678 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4503944
@@ Property / cites work: Q4503944 / rank @@
+Normal rank
@@ Property / cites work @@
+A few logs suffice to build (almost) all trees (I)
+Normal rank
@@ Property / cites work @@
+A fixed-parameter algorithm for minimum quartet inconsistency
+Normal rank
@@ Property / cites work @@
+A Polynomial Time Approximation Scheme for Inferring Evolutionary Trees from Quartet Topologies and Its Application
+Normal rank
@@ Property / cites work @@
+The complexity of reconstructing trees from qualitative characters and subtrees
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+A general method to speed up fixed-parameter-tractable algorithms
+Normal rank
@@ Property / cites work @@
+A polynomial time algorithm for the minimum quartet inconsistency problem with \(O(n)\) quartet errors
+Normal rank