On reconstructing species trees from gene trees in term of duplications and losses
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
Analogs and Duals of teh MAST Problem for Sequences and Trees
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Gene Trees and Species Trees: The Gene-Duplication Problem in Fixed-Parameter Tractable
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Algorithms for Exploring the Space of Gene Tree/Species Tree Reconciliations
RECOMB-CG '08 Proceedings of the international workshop on Comparative Genomics
Inferring species trees from gene duplication episodes
Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology
H-trees: a Model of Evolutionary Scenarios with Horizontal Gene Transfer
Fundamenta Informaticae - From Mathematical Beauty to the Truth of Nature: to Jerzy Tiuryn on his 60th Birthday
A linear time algorithm for error-corrected reconciliation of unrooted gene trees
ISBRA'11 Proceedings of the 7th international conference on Bioinformatics research and applications
Inferring evolutionary scenarios in the duplication, loss and horizontal gene transfer model
Logic and Program Semantics
The impact of parameterized complexity to interdisciplinary problem solving
The Multivariate Algorithmic Revolution and Beyond
| Hi-index | 0.00 |
A fundamental problem in computational biology is the determination of the correct species tree for a set of taxa given a set of (possibly contradictory) gene trees. In recent literature, the DUPLICATION/ LOSS model has received considerable attention. Here one measures the similarity/dissimilarity between a set of gene trees by counting the number of paralogous gene duplications and subsequent gene losses which need to be postulated in order to explain (in an evolutionarily meaningful way) how the gene trees could have arisen with respect to the species tree. Here we count the number of multiple gene duplication events (duplication events in the genome of the organism involving one or more genes) without regard to gene losses. MULTIPLE GENE DUPLICATION asks to find the species tree S which requires the fewest number of multiple gene duplication events to be postulated in order to explain a set of gene trees G1, G2,..., Gk. We also examine the related problem which assumes the species tree S is known and asks to find the explanation for G1, G2,..., Gk requiring the fewest multiple gene duplications. Via a reduction to and from a combinatorial model we call the BALL AND TRAP GAME, we show that the general form of this problem is NP-hard and various parameterized versions are hard for the complexity class W[1]. These results immediately imply that MULTIPLE GENE DUPLICATION is similarily hard. We prove that several parameterized variants are in FPT.