Inferring duplications, losses, transfers and incomplete lineage sorting with nonbinary species trees
Author(s) -
Maureen Stolzer,
Han Lai,
Minli Xu,
Deepa Sathaye,
Benjamin Vernot,
Dannie Durand
Publication year - 2012
Publication title -
bioinformatics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.599
H-Index - 390
eISSN - 1367-4811
pISSN - 1367-4803
DOI - 10.1093/bioinformatics/bts386
Subject(s) - phylogenetic tree , coalescent theory , lineage (genetic) , tree (set theory) , gene duplication , event (particle physics) , sorting , biology , phylogenetics , phylogenetic network , computer science , horizontal gene transfer , binary number , algorithm , gene , evolutionary biology , mathematics , genetics , combinatorics , physics , arithmetic , quantum mechanics
Gene duplication (D), transfer (T), loss (L) and incomplete lineage sorting (I) are crucial to the evolution of gene families and the emergence of novel functions. The history of these events can be inferred via comparison of gene and species trees, a process called reconciliation, yet current reconciliation algorithms model only a subset of these evolutionary processes.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom