Reconstructing a phylogenetic level-1 network from quartets (Q486621): Difference between revisions

@@ Property / DOI @@
-.1007/s11538-014-0022-z
@@ Property / DOI: 10.1007/s11538-014-0022-z / rank @@
-Normal rank
@@ Property / arXiv ID @@
+.5206
@@ Property / arXiv ID: 1308.5206 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3136877
@@ Property / cites work: Q3136877 / rank @@
+Normal rank
@@ Property / cites work @@
+Reconstructing the shape of a tree from observed dissimilarity data
+Normal rank
@@ Property / cites work @@
+Inferring evolutionary trees with strong combinatorial evidence
+Normal rank
@@ Property / cites work @@
+Algebraic Cryptanalysis
@@ Property / cites work: Algebraic Cryptanalysis / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
+Normal rank
@@ Property / cites work @@
+A few logs suffice to build (almost) all trees (I)
+Normal rank
@@ Property / cites work @@
+Two novel closure rules for constructing phylogenetic super-networks
+Normal rank
@@ Property / cites work @@
+Consistency of the QNet algorithm for generating planar split networks from weighted quartets
+Normal rank
@@ Property / cites work @@
+Q3902095
@@ Property / cites work: Q3902095 / 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 @@
+Q4792088
@@ Property / cites work: Q4792088 / rank @@
+Normal rank
@@ Property / cites work @@
+Cyclic permutations and evolutionary trees
@@ Property / cites work: Cyclic permutations and evolutionary trees / rank @@
+Normal rank
@@ Property / cites work @@
+Solving sparse linear equations over finite fields
+Normal rank
@@ Property / cites work @@
+The complexity of reconstructing trees from qualitative characters and subtrees
+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 / DOI @@
+.1007/S11538-014-0022-Z
@@ Property / DOI: 10.1007/S11538-014-0022-Z / rank @@
+Normal rank