Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees (Q2408842): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q38936462, #quickstatements; #temporary_batch_1707252663060 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q38936462 / rank | |||
Normal rank | |||
Revision as of 02:55, 7 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees |
scientific article |
Statements
Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees (English)
0 references
20 October 2017
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
