Finding high posterior density phylogenies by systematically extending a directed acyclic graph
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , , , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866916654868332544 |
|---|---|
| author | Jennings-Shaffer, Chris Rich, David H Macaulay, Matthew Karcher, Michael D Ganapathy, Tanvi Kiami, Shosuke Kooperberg, Anna Zhang, Cheng Suchard, Marc A Matsen IV, Frederick A |
| author_facet | Jennings-Shaffer, Chris Rich, David H Macaulay, Matthew Karcher, Michael D Ganapathy, Tanvi Kiami, Shosuke Kooperberg, Anna Zhang, Cheng Suchard, Marc A Matsen IV, Frederick A |
| contents | Bayesian phylogenetics typically estimates a posterior distribution, or aspects thereof, using Markov chain Monte Carlo methods. These methods integrate over tree space by applying local rearrangements to move a tree through its space as a random walk. Previous work explored the possibility of replacing this random walk with a systematic search, but was quickly overwhelmed by the large number of probable trees in the posterior distribution. In this paper we develop methods to sidestep this problem using a recently introduced structure called the subsplit directed acyclic graph (sDAG). This structure can represent many trees at once, and local rearrangements of trees translate to methods of enlarging the sDAG. Here we propose two methods of introducing, ranking, and selecting local rearrangements on sDAGs to produce a collection of trees with high posterior density. One of these methods successfully recovers the set of high posterior density trees across a range of data sets. However, we find that a simpler strategy of aggregating trees into an sDAG in fact is computationally faster and returns a higher fraction of probable trees. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_09074 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Finding high posterior density phylogenies by systematically extending a directed acyclic graph Jennings-Shaffer, Chris Rich, David H Macaulay, Matthew Karcher, Michael D Ganapathy, Tanvi Kiami, Shosuke Kooperberg, Anna Zhang, Cheng Suchard, Marc A Matsen IV, Frederick A Populations and Evolution Bayesian phylogenetics typically estimates a posterior distribution, or aspects thereof, using Markov chain Monte Carlo methods. These methods integrate over tree space by applying local rearrangements to move a tree through its space as a random walk. Previous work explored the possibility of replacing this random walk with a systematic search, but was quickly overwhelmed by the large number of probable trees in the posterior distribution. In this paper we develop methods to sidestep this problem using a recently introduced structure called the subsplit directed acyclic graph (sDAG). This structure can represent many trees at once, and local rearrangements of trees translate to methods of enlarging the sDAG. Here we propose two methods of introducing, ranking, and selecting local rearrangements on sDAGs to produce a collection of trees with high posterior density. One of these methods successfully recovers the set of high posterior density trees across a range of data sets. However, we find that a simpler strategy of aggregating trees into an sDAG in fact is computationally faster and returns a higher fraction of probable trees. |
| title | Finding high posterior density phylogenies by systematically extending a directed acyclic graph |
| topic | Populations and Evolution |
| url | https://arxiv.org/abs/2411.09074 |