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

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

Statements

instance of

scholarly article

0 references

title

Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees (English)

0 references

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

0 references

zbMATH Open document ID

1372.92069

0 references

1480.92142

0 references

DOI

10.1007/s11538-017-0260-y

0 references

10.1007/978-3-319-41168-2_5

0 references

0 references

0 references

0 references

0 references

Bulletin of Mathematical Biology

0 references

Algorithmic Aspects in Information and Management

0 references

publication date

20 October 2017

0 references

9 November 2016

0 references

full work available at URL

https://arxiv.org/abs/1604.03008

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

phylogenetics

0 references

compatibility

0 references

unrooted phylogenetic trees

0 references

parameterized complexity

0 references

FPT algorithm

0 references

dynamic programming

0 references

Wikidata QID

Q38936462

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

0 references

Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions

0 references

Phylogenetic supertrees. Combining information to reveal the tree of life

0 references

A $c^k n$ 5-Approximation Algorithm for Treewidth

0 references

Compatibility of unrooted phylogenetic trees is FPT

0 references

Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time

0 references

Q3577833

0 references

The complexity of first-order and monadic second-order logic revisited

0 references

Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves

0 references

Treewidth. Computations and approximations

0 references

Q4904144

0 references

Reconstruction of rooted trees from subtrees

0 references

The agreement problem for unrooted phylogenetic trees is FPT

0 references

The complexity of reconstructing trees from qualitative characters and subtrees

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2408842

@@ 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