Maximum clade credibility (MCC) trees for sequences with available collection dates were inferred for GI (N = 71 sequences) and GII (N = 915 sequences) using BEAST v.1.10.4 [51 (link)]. The best-fit partitioning scheme (GI: (1 + 2)(3), GII: (1,2,3)) and substitution models (GTR + I + G + X) for Bayesian analysis were chosen according to the Bayesian Information Criterion using the PartitionFinder 2 program [52 (link)]. For each genogroup, marginal likelihoods were calculated for combinations of coalescent tree priors (coalescent constant size, coalescent exponential growth) and molecular clock models (strict, relaxed log-normal) using the path sampling/stepping stone procedure implemented in BEAST v1.10.4 [53 (link)]. Then, different model settings were compared using the Bayes factor (BF) test. The combination of coalescent constant prior and relaxed lognormal molecular clock was strongly favored (log BF > 10) for both genogroups. The MCMC chains were run for 50 and 800 million steps with sampling every 5000 and 10,000 steps for GI и GII, respectively. The convergence of Markov chain Monte Carlo (MCMC) was inspected using Tracer v1.7 [54 (link)]. The maximum clade credibility (MCC) tree was annotated with TreeAnnotator v1.10.4 using 10% burn-in.
Phylogenetic Analysis of Norovirus Genotypes
Maximum clade credibility (MCC) trees for sequences with available collection dates were inferred for GI (N = 71 sequences) and GII (N = 915 sequences) using BEAST v.1.10.4 [51 (link)]. The best-fit partitioning scheme (GI: (1 + 2)(3), GII: (1,2,3)) and substitution models (GTR + I + G + X) for Bayesian analysis were chosen according to the Bayesian Information Criterion using the PartitionFinder 2 program [52 (link)]. For each genogroup, marginal likelihoods were calculated for combinations of coalescent tree priors (coalescent constant size, coalescent exponential growth) and molecular clock models (strict, relaxed log-normal) using the path sampling/stepping stone procedure implemented in BEAST v1.10.4 [53 (link)]. Then, different model settings were compared using the Bayes factor (BF) test. The combination of coalescent constant prior and relaxed lognormal molecular clock was strongly favored (log BF > 10) for both genogroups. The MCMC chains were run for 50 and 800 million steps with sampling every 5000 and 10,000 steps for GI и GII, respectively. The convergence of Markov chain Monte Carlo (MCMC) was inspected using Tracer v1.7 [54 (link)]. The maximum clade credibility (MCC) tree was annotated with TreeAnnotator v1.10.4 using 10% burn-in.
Corresponding Organization : Sechenov University
Other organizations : Lomonosov Moscow State University, InSysBio (Russia)
Variable analysis
- Phylogenetic tree inference method (IQ-TREE v1.6.12)
- Nucleotide substitution model (VP1: TIM2 + F + R10, RdRp: GTR + F + R10)
- Coalescent tree priors (coalescent constant size, coalescent exponential growth)
- Molecular clock models (strict, relaxed log-normal)
- VP1 and RdRp-encoding nucleotide sequences
- Maximum clade credibility (MCC) trees for GI and GII genogroups
- 10,000 pseudo-replicates for phylogenetic tree inference
- Midpoint rooting for phylogenetic trees
- Bayesian Information Criterion for selecting best-fit partitioning scheme and substitution models
- Path sampling/stepping stone procedure for calculating marginal likelihoods of different model settings
- Bayes factor (BF) test for comparing model settings
- MCMC chain convergence inspection using Tracer v1.7
- 10% burn-in for annotating the maximum clade credibility (MCC) tree
Annotations
Based on most similar protocols
As authors may omit details in methods from publication, our AI will look for missing critical information across the 5 most similar protocols.
About PubCompare
Our mission is to provide scientists with the largest repository of trustworthy protocols and intelligent analytical tools, thereby offering them extensive information to design robust protocols aimed at minimizing the risk of failures.
We believe that the most crucial aspect is to grant scientists access to a wide range of reliable sources and new useful tools that surpass human capabilities.
However, we trust in allowing scientists to determine how to construct their own protocols based on this information, as they are the experts in their field.
Ready to get started?
Sign up for free.
Registration takes 20 seconds.
Available from any computer
No download required
Revolutionizing how scientists
search and build protocols!