Till startsida
Webbkarta
Till innehåll Läs mer om hur kakor används på gu.se

DISSECT: an assignment-free Bayesian discovery method for species delimitation under the multispecies coalescent

Artikel i vetenskaplig tidskrift
Författare Graham Jones
Zeynep Aydin
Bengt Oxelman
Publicerad i Bioinformatics
Volym 31
Nummer/häfte 7
Sidor 991-998
ISSN 1367-4803
Publiceringsår 2015
Publicerad vid Institutionen för biologi och miljövetenskap
Sidor 991-998
Språk en
Länkar http://dx.doi.org/10.1093/bioinfor...
Ämneskategorier Bioinformatik och systembiologi, Biologisk systematik, Evolutionsbiologi

Sammanfattning

Motivation: The multispecies coalescent model provides a formal framework for the assignment of individual organisms to species, where the species are modeled as the branches of the species tree. None of the available approaches so far have simultaneously co-estimated all the relevant parameters in the model, without restricting the parameter space by requiring a guide tree and/or prior assignment of individuals to clusters or species. Results: We present DISSECT, which explores the full space of possible clusterings of individuals and species tree topologies in a Bayesian framework. It uses an approximation to avoid the need for reversible-jump MCMC, in the form of a prior that is a modification of the birth-death prior for the species tree. It incorporates a spike near zero in the density for node heights. The model has two extra parameters: one controls the degree of approximation, and the second controls the prior distribution on the numbers of species. It is implemented as part of BEAST and requires only a few changes from a standard *BEAST analysis. The method is evaluated on simulated data and demonstrated on an empirical data set. The method is shown to be insensitive to the degree of approximation, but quite sensitive to the second parameter, suggesting that large numbers of sequences are needed to draw firm conclusions.

Sidansvarig: Webbredaktion|Sidan uppdaterades: 2012-09-11
Dela:

På Göteborgs universitet använder vi kakor (cookies) för att webbplatsen ska fungera på ett bra sätt för dig. Genom att surfa vidare godkänner du att vi använder kakor.  Vad är kakor?