Gene tree reconciliation including transfers with replacement is NP-hard and FPT.
Damir HasicEric TannierPublished in: J. Comb. Optim. (2019)
Keyphrases
- np hard
- gene duplication
- tree structure
- approximation algorithms
- maximum weight
- lower bound
- special case
- fixed parameter tractable
- microarray
- optimal solution
- gene expression
- gene trees
- worst case
- linear programming
- tree structures
- binary tree
- computational complexity
- biomedical literature
- data sharing
- np complete
- text mining
- scheduling problem
- minimum cost
- integer programming
- b tree
- np hardness
- gene expression data