TY - GEN
T1 - Gene tree parsimony for incomplete gene trees
AU - Bayzid, Md Shamsuzzoha
AU - Warnow, Tandy
N1 - Publisher Copyright:
© Md. Shamsuzzoha Bayzid and Tandy Warnow.
PY - 2017/8/1
Y1 - 2017/8/1
N2 - Species tree estimation from gene trees can be complicated by gene duplication and loss, and "gene tree parsimony" (GTP) is one approach for estimating species trees from multiple gene trees. In its standard formulation, the objective is to find a species tree that minimizes the total number of gene duplications and losses with respect to the input set of gene trees. Although much is known about GTP, little is known about how to treat inputs containing some incomplete gene trees (i.e., gene trees lacking one or more of the species). We present new theory for GTP considering whether the incompleteness is due to gene birth and death (i.e., true biological loss) or taxon sampling, and present dynamic programming algorithms that can be used for an exact but exponential time solution for small numbers of taxa, or as a heuristic for larger numbers of taxa. We also prove that the "standard" calculations for duplications and losses exactly solve GTP when incompleteness results from taxon sampling, although they can be incorrect when incompleteness results from true biological loss. The software for the DP algorithm is freely available as open source code at https://github.com/shamsbayzid/DynaDup.
AB - Species tree estimation from gene trees can be complicated by gene duplication and loss, and "gene tree parsimony" (GTP) is one approach for estimating species trees from multiple gene trees. In its standard formulation, the objective is to find a species tree that minimizes the total number of gene duplications and losses with respect to the input set of gene trees. Although much is known about GTP, little is known about how to treat inputs containing some incomplete gene trees (i.e., gene trees lacking one or more of the species). We present new theory for GTP considering whether the incompleteness is due to gene birth and death (i.e., true biological loss) or taxon sampling, and present dynamic programming algorithms that can be used for an exact but exponential time solution for small numbers of taxa, or as a heuristic for larger numbers of taxa. We also prove that the "standard" calculations for duplications and losses exactly solve GTP when incompleteness results from taxon sampling, although they can be incorrect when incompleteness results from true biological loss. The software for the DP algorithm is freely available as open source code at https://github.com/shamsbayzid/DynaDup.
KW - Deep coalescence
KW - Gene duplication and loss
KW - Gene tree parsimony
UR - http://www.scopus.com/inward/record.url?scp=85028768974&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85028768974&partnerID=8YFLogxK
U2 - 10.4230/LIPIcs.WABI.2017.2
DO - 10.4230/LIPIcs.WABI.2017.2
M3 - Conference contribution
AN - SCOPUS:85028768974
T3 - Leibniz International Proceedings in Informatics, LIPIcs
BT - 17th International Workshop on Algorithms in Bioinformatics, WABI 2017
A2 - Reinert, Knut
A2 - Schwartz, Russell
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
T2 - 17th International Workshop on Algorithms in Bioinformatics, WABI 2017
Y2 - 21 August 2017 through 23 August 2017
ER -