2022
DOI: 10.1016/j.jtbi.2022.111186
|View full text |Cite
|
Sign up to set email alerts
|

The bounded coalescent model: Conditioning a genealogy on a minimum root date

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
2
2

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 49 publications
0
4
0
Order By: Relevance
“…Our method implements a general pathogen population growth model rather than using the constant bounded coalescent model (Carson et al, 2022). The main restriction on the choice of model is that we must be able to calculate the likelihood of the phylogenetic tree, which in turn means that the coalescence rate must be integrable.…”
Section: Discussionmentioning
confidence: 99%
See 2 more Smart Citations
“…Our method implements a general pathogen population growth model rather than using the constant bounded coalescent model (Carson et al, 2022). The main restriction on the choice of model is that we must be able to calculate the likelihood of the phylogenetic tree, which in turn means that the coalescence rate must be integrable.…”
Section: Discussionmentioning
confidence: 99%
“…Thirdly, a complete transmission bottleneck meaning that only a single lineage is ever transmitted between hosts. In other words the within-host coalescent process is bounded so that the most recent common ancestor within a host occurs after the date of infection (Carson et al, 2022).…”
Section: New Approachesmentioning
confidence: 99%
See 1 more Smart Citation
“…However, here we consider an alternative equivalent formulation of the coalescent model, in which the phylogeny is formed by iterating over the leaves one by one in increasing order of date, and considering how each leaf coalesces with the phylogeny made by the previous leaves ( Carson et al , 2022 ; Didelot et al , 2014 ). To do so, we consider that the dates of the leaves are in increasing order, and that the dates of the internal nodes are ordered so that corresponds to the date of the internal node created when adding the leaf indexed k to the tree made of the first k − 1 leaves.…”
Section: Methodsmentioning
confidence: 99%