Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees (Q2408842): Difference between revisions

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees
@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 6649746
@@ Property / title @@
+Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees (English)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.92142
@@ Property / zbMATH Open document ID: 1480.92142 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-319-41168-2_5
@@ Property / DOI: 10.1007/978-3-319-41168-2_5 / rank @@
+Normal rank
@@ Property / published in @@
+Algorithmic Aspects in Information and Management
+Normal rank
@@ Property / publication date @@
+November 2016Timestamp +2016-11-09T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2016-11-09T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 9 November 2016 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C90
@@ Property / Mathematics Subject Classification ID: 05C90 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6649746
@@ Property / zbMATH DE Number: 6649746 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2952589317
@@ Property / OpenAlex ID: W2952589317 / rank @@
+Normal rank
@@ Property / cites work @@
+Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
+Normal rank
@@ Property / cites work @@
+Phylogenetic supertrees. Combining information to reveal the tree of life
+Normal rank
@@ Property / cites work @@
+A $c^k n$ 5-Approximation Algorithm for Treewidth
@@ Property / cites work: A $c^k n$ 5-Approximation Algorithm for Treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Compatibility of unrooted phylogenetic trees is FPT
+Normal rank
@@ Property / cites work @@
+Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
+Normal rank
@@ Property / cites work @@
+Q3577833
@@ Property / cites work: Q3577833 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of first-order and monadic second-order logic revisited
+Normal rank
@@ Property / cites work @@
+Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+Q4904144
@@ Property / cites work: Q4904144 / rank @@
+Normal rank
@@ Property / cites work @@
+Reconstruction of rooted trees from subtrees
@@ Property / cites work: Reconstruction of rooted trees from subtrees / rank @@
+Normal rank
@@ Property / cites work @@
+The agreement problem for unrooted phylogenetic trees is FPT
+Normal rank
@@ Property / cites work @@
+The complexity of reconstructing trees from qualitative characters and subtrees
+Normal rank

Latest revision as of 22:25, 12 July 2024

scientific article; zbMATH DE number 6649746

Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees

Language	Label	Description	Also known as
English	Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees	scientific article; zbMATH DE number 6649746	Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees