Consequences of Common Topological Rearrangements for Partition Trees in Phylogenomic Inference
In phylogenomic analysis the collection of trees with identical score (maximum likelihood or parsimony score) may hamper tree search algorithms. Such collections are coined phylogenetic terraces. For sparse supermatrices with a lot of missing data, the number of terraces and the number of trees on t... Full description
Journal Title:  Journal of Computational Biology 20151201, Vol.22 (12), p.11291142 
Main Author:  Chernomor, Olga 
Other Authors:  Minh, Bui Quang , von Haeseler, Arndt 
Format:  Electronic Article 
Language: 
English 
Subjects:  
Quelle:  Alma/SFX Local Collection 
Publisher:  United States: Mary Ann Liebert, Inc 
ID:  ISSN: 10665277 
Link:  https://www.ncbi.nlm.nih.gov/pubmed/26448206 
Zum Text: 
SendSend as email
Add to Book BagAdd to Book Bag
Staff View
recordid:  cdi_pubmedcentral_primary_oai_pubmedcentral_nih_gov_4663649 
title:  Consequences of Common Topological Rearrangements for Partition Trees in Phylogenomic Inference 
format:  Article 
creator: 

subjects: 

ispartof:  Journal of Computational Biology, 20151201, Vol.22 (12), p.11291142 
description:  In phylogenomic analysis the collection of trees with identical score (maximum likelihood or parsimony score) may hamper tree search algorithms. Such collections are coined phylogenetic terraces. For sparse supermatrices with a lot of missing data, the number of terraces and the number of trees on the terraces can be very large. If terraces are not taken into account, a lot of computation time might be unnecessarily spent to evaluate many trees that in fact have identical score. To save computation time during the tree search, it is worthwhile to quickly identify such cases. The score of a species tree is the sum of scores for all the socalled induced partition trees. Therefore, if the topological rearrangement applied to a species tree does not change the induced partition trees, the score of these partition trees is unchanged. Here, we provide the conditions under which the three most widely used topological rearrangements (nearest neighbor interchange, subtree pruning and regrafting, and tree bisection and reconnection) change the topologies of induced partition trees. During the tree search, these conditions allow us to quickly identify whether we can save computation time on the evaluation of newly encountered trees. We also introduce the concept of partial terraces and demonstrate that they occur more frequently than the original “full” terrace. Hence, partial terrace is the more important factor of timesaving compared to full terrace. Therefore, taking into account the above conditions and the partial terrace concept will help to speed up the tree search in phylogenomic inference. 
language:  eng 
source:  Alma/SFX Local Collection 
identifier:  ISSN: 10665277 
fulltext:  fulltext 
issn: 

url:  Link 
@attributes 
 
PrimoNMBib 
