Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees (Q2408842): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q38936462, #quickstatements; #temporary_batch_1707252663060 |
ReferenceBot (talk | contribs) Changed an Item |
||||||||||||||
(5 intermediate revisions by 4 users not shown) | |||||||||||||||
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) | |||||||||||||||
Property / title: Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees (English) / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH Open document ID | |||||||||||||||
Property / zbMATH Open document ID: 1480.92142 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / DOI | |||||||||||||||
Property / DOI: 10.1007/978-3-319-41168-2_5 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / published in | |||||||||||||||
Property / published in: Algorithmic Aspects in Information and Management / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / publication date | |||||||||||||||
9 November 2016
| |||||||||||||||
Property / publication date: 9 November 2016 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / Mathematics Subject Classification ID | |||||||||||||||
Property / Mathematics Subject Classification ID: 05C90 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH DE Number | |||||||||||||||
Property / zbMATH DE Number: 6649746 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / MaRDI profile type | |||||||||||||||
Property / MaRDI profile type: MaRDI publication profile / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / OpenAlex ID | |||||||||||||||
Property / OpenAlex ID: W2339239829 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / OpenAlex ID | |||||||||||||||
Property / OpenAlex ID: W2952589317 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / arXiv ID | |||||||||||||||
Property / arXiv ID: 1604.03008 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Phylogenetic supertrees. Combining information to reveal the tree of life / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: A $c^k n$ 5-Approximation Algorithm for Treewidth / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Compatibility of unrooted phylogenetic trees is FPT / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Q3577833 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: The complexity of first-order and monadic second-order logic revisited / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Treewidth. Computations and approximations / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Q4904144 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Reconstruction of rooted trees from subtrees / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: The agreement problem for unrooted phylogenetic trees is FPT / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: The complexity of reconstructing trees from qualitative characters and subtrees / rank | |||||||||||||||
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 |
|
Statements
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
20 October 2017
0 references
9 November 2016
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
0 references
0 references