On Computing the Maximum Parsimony Score of a Phylogenetic Network (Q5251626): Difference between revisions

@@ Property / OpenAlex ID @@
+W2083011587
@@ Property / OpenAlex ID: W2083011587 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.2430
@@ Property / arXiv ID: 1302.2430 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Multiterminal Cuts
@@ Property / cites work: The Complexity of Multiterminal Cuts / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+The Steiner problem in phylogeny is NP-complete
@@ Property / cites work: The Steiner problem in phylogeny is NP-complete / rank @@
+Normal rank
@@ Property / cites work @@
+On Computing the Maximum Parsimony Score of a Phylogenetic Network
+Normal rank
@@ Property / cites work @@
+When two trees go to war
@@ Property / cites work: When two trees go to war / rank @@
+Normal rank
@@ Property / cites work @@
+Locating a tree in a phylogenetic network
@@ Property / cites work: Locating a tree in a phylogenetic network / rank @@
+Normal rank
@@ Property / cites work @@
+Seeing the trees and their branches in the network is hard
+Normal rank
@@ Property / cites work @@
+Rounding algorithms for a geometric embedding of minimum multiway cut
+Normal rank
@@ Property / cites work @@
+Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Locating the vertices of a steiner tree in an arbitrary metric space
+Normal rank
@@ Property / cites work @@
+Q4792088
@@ Property / cites work: Q4792088 / rank @@
+Normal rank
@@ Property / cites work @@
+Simple and improved parameterized algorithms for multiterminal cuts
+Normal rank