Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
Species Tree Inference Methods Intended to Deal with Incomplete Lineage Sorting Are Robust to the Presence of Paralogs
by
Hahn, Matthew W.
, Du, Peng
, Smith, Megan L.
, Nakhleh, Luay
, Yan, Zhi
in
Computer Simulation
/ Discordance
/ Gene Duplication
/ Genome
/ Models, Genetic
/ Orthology
/ Phylogenetics
/ Phylogeny
/ Regular
/ REGULAR ARTICLES
/ Species
2022
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Species Tree Inference Methods Intended to Deal with Incomplete Lineage Sorting Are Robust to the Presence of Paralogs
by
Hahn, Matthew W.
, Du, Peng
, Smith, Megan L.
, Nakhleh, Luay
, Yan, Zhi
in
Computer Simulation
/ Discordance
/ Gene Duplication
/ Genome
/ Models, Genetic
/ Orthology
/ Phylogenetics
/ Phylogeny
/ Regular
/ REGULAR ARTICLES
/ Species
2022
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Species Tree Inference Methods Intended to Deal with Incomplete Lineage Sorting Are Robust to the Presence of Paralogs
by
Hahn, Matthew W.
, Du, Peng
, Smith, Megan L.
, Nakhleh, Luay
, Yan, Zhi
in
Computer Simulation
/ Discordance
/ Gene Duplication
/ Genome
/ Models, Genetic
/ Orthology
/ Phylogenetics
/ Phylogeny
/ Regular
/ REGULAR ARTICLES
/ Species
2022
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Species Tree Inference Methods Intended to Deal with Incomplete Lineage Sorting Are Robust to the Presence of Paralogs
Journal Article
Species Tree Inference Methods Intended to Deal with Incomplete Lineage Sorting Are Robust to the Presence of Paralogs
2022
Request Book From Autostore
and Choose the Collection Method
Overview
Many recent phylogenetic methods have focused on accurately inferring species trees when there is gene tree discordance due to incomplete lineage sorting (ILS). For almost all of these methods, and for phylogenetic methods in general, the data for each locus are assumed to consist of orthologous, single-copy sequences. Loci that are present in more than a single copy in any of the studied genomes are excluded from the data. These steps greatly reduce the number of loci available for analysis. The question we seek to answer in this study is: what happens if one runs such species tree inference methods on data where paralogy is present, in addition to or without ILS being present? Through simulation studies and analyses of two large biological data sets, we show that running such methods on data with paralogs can still provide accurate results. We use multiple different methods, some of which are based directly on the multispecies coalescent model, and some ofwhich have been proven to be statistically consistent under it.We also treat the paralogous loci in multipleways: from explicitly denoting them as paralogs, to randomly selecting one copy per species. In all cases, the inferred species trees are as accurate as equivalent analyses using single-copy orthologs. Our results have significant implications for the use of ILS-aware phylogenomic analyses, demonstrating that they do not have to be restricted to single-copy loci. This will greatly increase the amount of data that can be used for phylogenetic inference.
Publisher
Oxford University Press
Subject
This website uses cookies to ensure you get the best experience on our website.