Uniform random generation of decomposable structures using floating-point arithmetic
Theoretical Computer Science - Special issue on Caen '97
From Gene Trees to Species Trees
SIAM Journal on Computing
On the Multiple Gene Duplication Problem
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
Reconciling a gene tree to a species tree under the duplication cost model
Theoretical Computer Science
DLS-trees: a model of evolutionary scenarios
Theoretical Computer Science
A heuristic algorithm for reconstructing ancestral gene orders with duplications
RECOMB-CG'07 Proceedings of the 2007 international conference on Comparative genomics
Reconciling gene trees with apparent polytomies
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
New Perspectives on Gene Family Evolution: Losses in Reconciliation and a Link with Supertrees
RECOMB 2'09 Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology
Hi-index | 0.00 |
We describe algorithms to explore the space of all possible reconciliations between a gene tree and a species tree. We propose an algorithm for generating a random reconciliation, and combinatorial operators and algorithms to explore the space of all possible reconciliations between a gene tree and a species tree in optimal time. We apply these algorithms to simulated data.