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

From MaRDI portal
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

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
0 references
0 references
0 references
0 references
0 references
0 references
20 October 2017
0 references
9 November 2016
0 references
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
0 references
0 references
0 references
0 references