Models, algorithms and programs for phylogeny reconciliation

Gene sequences contain a gold mine of phylogenetic information. But unfortunately for taxonomists this information does not only tell the story of the species from which it was collected. Genes have their own complex histories which record speciation events, of course, but also many other events. Am...

Full description

Saved in:
Bibliographic Details
Published in:Briefings in bioinformatics Vol. 12; no. 5; pp. 392 - 400
Main Authors: Doyon, Jean-Philippe, Ranwez, Vincent, Daubin, Vincent, Berry, Vincent
Format: Journal Article
Language:English
Published: England Oxford University Press 01.09.2011
Oxford Publishing Limited (England)
Oxford University Press (OUP)
Subjects:
ISSN:1467-5463, 1477-4054, 1477-4054
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Gene sequences contain a gold mine of phylogenetic information. But unfortunately for taxonomists this information does not only tell the story of the species from which it was collected. Genes have their own complex histories which record speciation events, of course, but also many other events. Among them, gene duplications, transfers and losses are especially important to identify. These events are crucial to account for when reconstructing the history of species, and they play a fundamental role in the evolution of genomes, the diversification of organisms and the emergence of new cellular functions. We review reconciliations between gene and species trees, which are rigorous approaches for identifying duplications, transfers and losses that mark the evolution of a gene family. Existing reconciliation models and algorithms are reviewed and difficulties in modeling gene transfers are discussed. We also compare different reconciliation programs along with their advantages and disadvantages.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
ObjectType-Review-3
content type line 23
ObjectType-Article-2
ISSN:1467-5463
1477-4054
1477-4054
DOI:10.1093/bib/bbr045