Abstract
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. © 2008 Springer-Verlag.
Cite
CITATION STYLE
Doyon, J. P., Chauve, C., & Hamel, S. (2008). Algorithms for exploring the space of gene tree/species tree reconciliations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5267 LNBI, pp. 1–13). https://doi.org/10.1007/978-3-540-87989-3_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
