Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees (Q2408842)
From MaRDI portal
No description defined
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees |
No description defined |
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
