Inferring polyploid phylogenies from multiply-labeled gene trees
<p>Abstract</p> <p>Background</p> <p>Gene trees that arise in the context of reconstructing the evolutionary history of polyploid species are often multiply-labeled, that is, the same leaf label can occur several times in a single tree. This property considerably compli...
Main Authors: | , , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
BMC
2009-08-01
|
Series: | BMC Evolutionary Biology |
Online Access: | http://www.biomedcentral.com/1471-2148/9/216 |
id |
doaj-300b86645ba04fa0b4a3bfb6d537d010 |
---|---|
record_format |
Article |
spelling |
doaj-300b86645ba04fa0b4a3bfb6d537d0102021-09-02T10:00:35ZengBMCBMC Evolutionary Biology1471-21482009-08-019121610.1186/1471-2148-9-216Inferring polyploid phylogenies from multiply-labeled gene treesPetri AnnaHuber Katharina TSpillner AndreasLott MartinOxelman BengtMoulton Vincent<p>Abstract</p> <p>Background</p> <p>Gene trees that arise in the context of reconstructing the evolutionary history of polyploid species are often multiply-labeled, that is, the same leaf label can occur several times in a single tree. This property considerably complicates the task of forming a consensus of a collection of such trees compared to usual phylogenetic trees.</p> <p>Results</p> <p>We present a method for computing a consensus tree of multiply-labeled trees. As with the well-known greedy consensus tree approach for phylogenetic trees, our method first breaks the given collection of gene trees into a set of clusters. It then aims to insert these clusters one at a time into a tree, starting with the clusters that are supported by most of the gene trees. As the problem to decide whether a cluster can be inserted into a multiply-labeled tree is computationally hard, we have developed a heuristic method for solving this problem.</p> <p>Conclusion</p> <p>We illustrate the applicability of our method using two collections of trees for plants of the genus <it>Silene</it>, that involve several allopolyploids at different levels.</p> http://www.biomedcentral.com/1471-2148/9/216 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Petri Anna Huber Katharina T Spillner Andreas Lott Martin Oxelman Bengt Moulton Vincent |
spellingShingle |
Petri Anna Huber Katharina T Spillner Andreas Lott Martin Oxelman Bengt Moulton Vincent Inferring polyploid phylogenies from multiply-labeled gene trees BMC Evolutionary Biology |
author_facet |
Petri Anna Huber Katharina T Spillner Andreas Lott Martin Oxelman Bengt Moulton Vincent |
author_sort |
Petri Anna |
title |
Inferring polyploid phylogenies from multiply-labeled gene trees |
title_short |
Inferring polyploid phylogenies from multiply-labeled gene trees |
title_full |
Inferring polyploid phylogenies from multiply-labeled gene trees |
title_fullStr |
Inferring polyploid phylogenies from multiply-labeled gene trees |
title_full_unstemmed |
Inferring polyploid phylogenies from multiply-labeled gene trees |
title_sort |
inferring polyploid phylogenies from multiply-labeled gene trees |
publisher |
BMC |
series |
BMC Evolutionary Biology |
issn |
1471-2148 |
publishDate |
2009-08-01 |
description |
<p>Abstract</p> <p>Background</p> <p>Gene trees that arise in the context of reconstructing the evolutionary history of polyploid species are often multiply-labeled, that is, the same leaf label can occur several times in a single tree. This property considerably complicates the task of forming a consensus of a collection of such trees compared to usual phylogenetic trees.</p> <p>Results</p> <p>We present a method for computing a consensus tree of multiply-labeled trees. As with the well-known greedy consensus tree approach for phylogenetic trees, our method first breaks the given collection of gene trees into a set of clusters. It then aims to insert these clusters one at a time into a tree, starting with the clusters that are supported by most of the gene trees. As the problem to decide whether a cluster can be inserted into a multiply-labeled tree is computationally hard, we have developed a heuristic method for solving this problem.</p> <p>Conclusion</p> <p>We illustrate the applicability of our method using two collections of trees for plants of the genus <it>Silene</it>, that involve several allopolyploids at different levels.</p> |
url |
http://www.biomedcentral.com/1471-2148/9/216 |
work_keys_str_mv |
AT petrianna inferringpolyploidphylogeniesfrommultiplylabeledgenetrees AT huberkatharinat inferringpolyploidphylogeniesfrommultiplylabeledgenetrees AT spillnerandreas inferringpolyploidphylogeniesfrommultiplylabeledgenetrees AT lottmartin inferringpolyploidphylogeniesfrommultiplylabeledgenetrees AT oxelmanbengt inferringpolyploidphylogeniesfrommultiplylabeledgenetrees AT moultonvincent inferringpolyploidphylogeniesfrommultiplylabeledgenetrees |
_version_ |
1721176653356335104 |