An Optimal Reconciliation Algorithm for Gene Trees with Polytomies

@inproceedings{Lafond2012AnOR,
  title={An Optimal Reconciliation Algorithm for Gene Trees with Polytomies},
  author={Manuel Lafond and Krister M. Swenson and Nadia El-Mabrouk},
  booktitle={WABI},
  year={2012}
}
Reconciliation is a method widely used to infer the evolutionary relationship between the members of a gene family. It consists of comparing a gene tree with a species tree, and interpreting the incongruence between the two trees as evidence of duplication and loss. In the case of binary rooted trees, linear-time algorithms have been developed for the duplication, loss, and mutation (duplication + loss) costs. However, a strict prerequisite to reconciliation is to have a gene tree free from… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 21 references

An Efficient Algorithm for Gene/Species Trees Parsimonious Reconciliation with Losses, Duplications and Transfers

  • Doyon, J.-P., +4 authors V. Berry
  • Tannier, E. (ed.) RECOMB-CG 2010. LNCS, vol. 6398…
  • 2010
1 Excerpt

Similar Papers

Loading similar papers…