The DOI matches its Crossref record; 83 of the 83 references it cites were found in a registry or an index.
Using PhyloSuite for molecular phylogeny and tree‐based analyses
Open accessAbstract
Phylogenetic analysis has entered the genomics (multilocus) era. For less experienced researchers, conquering the large number of software programs required for a multilocus‐based phylogenetic reconstruction can be somewhat daunting and time‐consuming. PhyloSuite, a software with a user‐friendly GUI, was designed to make this process more accessible by integrating multiple software programs needed for multilocus and single‐gene phylogenies and further streamlining the whole process. In this protocol, we aim to explain how to conduct each step of the phylogenetic pipeline and tree‐based analyses in PhyloSuite. We also present a new version of PhyloSuite (v1.2.3), wherein we fixed some bugs, made some optimizations, and introduced some new functions, including a number of tree‐based analyses, such as signal‐to‐noise calculation, saturation analysis, spurious species identification, and etc. The step‐by‐step protocol includes background information (i.e., what the step does), reasons (i.e., why do the step), and operations (i.e., how to do it). This protocol will help researchers quick‐start their way through the multilocus phylogenetic analysis, especially those interested in conducting organelle‐based analyses.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Tamura, K., Peterson, D., Peterson, N., Stecher, G., Nei, M., & Kumar, S. (2011) · Molecular Biology and Evolution · doi:10.1093/molbev/msr121 · Cited by 39,969
MEGA X: Molecular Evolutionary Genetics Analysis across Computing Platforms
Kumar, S., Stecher, G., Li, M., Knyaz, C., & Tamura, K. (2018) · Molecular Biology and Evolution · doi:10.1093/molbev/msy096 · Cited by 37,529
RAxML version 8: a tool for phylogenetic analysis and post-analysis of large phylogenies
Stamatakis, A. (2014) · Bioinformatics · doi:10.1093/bioinformatics/btu033 · Cited by 32,291
MrBayes 3.2: Efficient Bayesian Phylogenetic Inference and Model Choice Across a Large Model Space
Ronquist, F., Teslenko, M., van der Mark, P., Ayres, D. L., Darling, A., Höhna, S., Larget, B., Liu, L., Suchard, M. A., & Huelsenbeck, J. P. (2012) · Systematic Biology · doi:10.1093/sysbio/sys029 · Cited by 27,843
IQ-TREE: A Fast and Effective Stochastic Algorithm for Estimating Maximum-Likelihood Phylogenies
Nguyen, L.-T., Schmidt, H. A., von Haeseler, A., & Minh, B. Q. (2015) · Molecular Biology and Evolution · doi:10.1093/molbev/msu300 · Cited by 26,046
MRBAYES: Bayesian inference of phylogenetic trees.
Huelsenbeck, J. P., & Ronquist, F. (2001) · Bioinformatics · doi:10.1093/bioinformatics/17.8.754 · Cited by 21,937
MAFFT: a novel method for rapid multiple sequence alignment based on fast Fourier transform
Katoh, K. (2002) · Nucleic Acids Research · doi:10.1093/nar/gkf436 · Cited by 17,027
IQ-TREE 2: New Models and Efficient Methods for Phylogenetic Inference in the Genomic Era
Minh, B. Q., Schmidt, H. A., Chernomor, O., Schrempf, D., Woodhams, M. D., von Haeseler, A., & Lanfear, R. (2020) · Molecular Biology and Evolution · doi:10.1093/molbev/msaa015 · Cited by 16,873
Inference from iterative simulation using multiple sequences
Gelman, A., & Rubin, D. B. (1992) · Statistical Science · doi:10.1214/ss/1177011136 · Cited by 16,627
Evolutionary trees from DNA sequences: A maximum likelihood approach.
Felsenstein, J. (1981) · Journal of Molecular Evolution · doi:10.1007/bf01734359 · Cited by 14,571 · cited 1×
“Two schemes were developed to save the computation time: (1) a pruning algorithm, which can reduce the repeated calculation for lnL [46, 47], and (2) heuristic tree search, such as branch ‐ swapping algorithms.”
Method
Cited by
Brochosomes as an antireflective camouflage coating for leafhoppers
Wu, W., Mao, Q., Ye, Z.-X., Liao, Z., Shan, H.-W., Li, J.-M., Zhang, C.-X., & Chen, J.-P. (2025) · eLife · doi:10.7554/elife.99639.3 · Cited by 3
Metadata
- Authors
- Xiang, C., Gao, F., Jakovlić, I., Lei, H., Hu, Y., Zhang, H., Zou, H., Wang, G., & Zhang, D.
- Venue
- iMeta
- Publisher
- Wiley
- Published
- 2023-02
- Volume
- 2
- Issue
- 1
- Pages
- e87-e87
- ISSN
- 2770-596X (ISSN-L)
- OpenAlex
- W4321242087
- Cited by
- 558
- References
- 83
- FWCI
- 42.07
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.