Huaiyan Ren
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Huaiyan Ren has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Bui Quang Minh
Australian National University
5 shared publications - Robert Lanfear
Australian National University
5 shared publications - Thomas King-Fung Wong
Australian National University
5 shared publications - Changsen Jiang
Australian National University
2 shared publications - Edward Susko
Institute for Comparative Genomics, Dalhousie University, Halifax, NS, B3H 4R2, Canada
2 shared publications - Andrew James Roger
Department of Biochemistry & Molecular Biology, Dalhousie University, Halifax, Nova Scotia, Canada
1 shared publication
Latest Publications
- Open Access
PartitionFinder-mAIC: Phylogenetic Partitioning using Marginal Akaike Information Criterion
Partition models are widely used in phylogenomic analyses to account for heterogeneous evolutionary processes across different regions or loci of a sequence alignment. How alignment regions are grouped into partitions (the partitioning scheme) affects both the degree of over- or under-parameterization and the accuracy of downstream phylogenetic inferences. PartitionFinder is a widely adopted framework for selecting an optimal partitioning scheme. Using Akaike information criterion (AIC) and Bayesian information criterion (BIC), PartitionFinder merges partitions with similar evolutionary processes to avoid model overfitting. However, AIC and BIC are based on conditional likelihoods that treat partition assignments as fixed, whereas the recently introduced marginal AIC (mAIC) averages site likelihoods over the models of all partitions, providing a more appropriate criterion for inferring global parameters such as tree topology and branch lengths (Susko et al. 2026). Here, we implement mAIC for partition models in IQ-TREE 3 and integrate it into the PartitionFinder algorithms. Using a range of simulated and empirical DNA and protein datasets, we show that PartitionFinder-mAIC yields partitioning schemes with fewer partitions than those selected by AIC or BIC, and additionally improves phylogenetic inference at most key branches of the green plant evolution. The new PartitionFinder-mAIC is available in IQ-TREE version 3.1.4 with the command-line option -merit mAIC.
Open AccessPartitionFinder-mAIC: Phylogenetic Partitioning using Marginal Akaike Information Criterion
Partition models are widely used in phylogenomic analyses to account for heterogeneous evolutionary processes across different regions or loci of a sequence alignment. How alignment regions are grouped into partitions (the partitioning scheme) affects both the degree of over- or under-parameterization and the accuracy of downstream phylogenetic inferences. PartitionFinder is a widely adopted framework for selecting an optimal partitioning scheme. Using Akaike information criterion (AIC) and Bayesian information criterion (BIC), PartitionFinder merges partitions with similar evolutionary processes to avoid model overfitting. However, AIC and BIC are based on conditional likelihoods that treat partition assignments as fixed, whereas the recently introduced marginal AIC (mAIC) averages site likelihoods over the models of all partitions, providing a more appropriate criterion for inferring global parameters such as tree topology and branch lengths (Susko et al. 2026). Here, we implement mAIC for partition models in IQ-TREE 3 and integrate it into the PartitionFinder algorithms. Using a range of simulated and empirical DNA and protein datasets, we show that PartitionFinder-mAIC yields partitioning schemes with fewer partitions than those selected by AIC or BIC, and additionally improves phylogenetic inference at most key branches of the green plant evolution. The new PartitionFinder-mAIC is available in IQ-TREE version 3.1.4 with the command-line option -merit mAIC.
- Top Cited PapersOpen Access
- 1 May 2026
- Published by Oxford University Press (OUP) in Molecular Biology and Evolution
- Vol. 43 (5)
IQ-TREE 3: phylogenomic inference software using complex evolutionary models
IQ-TREE (https://iqtree.github.io/) is a widely used open-source software tool for efficiently inferring phylogenetic trees under maximum likelihood. Here, we present IQ-TREE version 3, the third major release of the software. IQ-TREE 3 significantly extends version 2 with new features, including mixture models as an alternative to partitioned models, gene and site concordance factors to quantify discordance between genomic regions, integration with phylogenomic divergence time estimation, and a fully featured sequence simulator. The IQ-TREE 3 source code is available at https://github.com/iqtree/iqtree3.
- 1 May 2026
- Published by Oxford University Press (OUP) in Molecular Biology and Evolution
- Vol. 43 (5)
Top Cited PapersOpen AccessIQ-TREE 3: phylogenomic inference software using complex evolutionary models
IQ-TREE (https://iqtree.github.io/) is a widely used open-source software tool for efficiently inferring phylogenetic trees under maximum likelihood. Here, we present IQ-TREE version 3, the third major release of the software. IQ-TREE 3 significantly extends version 2 with new features, including mixture models as an alternative to partitioned models, gene and site concordance factors to quantify discordance between genomic regions, integration with phylogenomic divergence time estimation, and a fully featured sequence simulator. The IQ-TREE 3 source code is available at https://github.com/iqtree/iqtree3.
- Open Access
A New Information Theoretic Approach Shows that Mixture Models Outperform Partition Models for Phylogenetic Analyses of Amino Acid Data
Partition and mixture models are widely employed in Maximum Likelihood phylogenetic analyses of large genomic datasets. Comparing the fit of the two types of models has been challenging, because standard information-theoretic approaches cannot be applied. Mixture models are increasingly popular for the analysis of amino acid datasets and can lead to different conclusions compared to partition models. This raises an important question – which type of model tends to perform better? Susko et al. (2026) recently introduced the marginal Akaike information criterion (mAIC), which allows mixture models and partition models to be directly compared for the first time. Here, we use the mAIC and a range of other approaches to compare the fit of mixture and partition models across a diverse set of empirical amino acid datasets. We show that the mAIC favours mixture models in all the datasets we examined. This has important implications for interpreting empirical analyses and suggests that continued development of mixture models is an important avenue for future research.
Open AccessA New Information Theoretic Approach Shows that Mixture Models Outperform Partition Models for Phylogenetic Analyses of Amino Acid Data
Partition and mixture models are widely employed in Maximum Likelihood phylogenetic analyses of large genomic datasets. Comparing the fit of the two types of models has been challenging, because standard information-theoretic approaches cannot be applied. Mixture models are increasingly popular for the analysis of amino acid datasets and can lead to different conclusions compared to partition models. This raises an important question – which type of model tends to perform better? Susko et al. (2026) recently introduced the marginal Akaike information criterion (mAIC), which allows mixture models and partition models to be directly compared for the first time. Here, we use the mAIC and a range of other approaches to compare the fit of mixture and partition models across a diverse set of empirical amino acid datasets. We show that the mAIC favours mixture models in all the datasets we examined. This has important implications for interpreting empirical analyses and suggests that continued development of mixture models is an important avenue for future research.
- Open Access
- 23 December 2024
- Published by Oxford University Press (OUP) in Molecular Biology and Evolution
- Vol. 42 (1)
MixtureFinder: Estimating DNA Mixture Models for Phylogenetic Analyses
In phylogenetic studies, both partitioned models and mixture models are used to account for heterogeneity in molecular evolution among the sites of DNA sequence alignments. Partitioned models require the user to specify the grouping of sites into subsets, and then assume that each subset of sites can be modeled by a single common process. Mixture models do not require users to prespecify subsets of sites, and instead calculate the likelihood of every site under every model, while co-estimating the model weights and parameters. While much research has gone into the optimization of partitioned models by merging user-specified subsets, there has been less attention paid to the optimization of mixture models for DNA sequence alignments. In this study, we first ask whether a key assumption of partitioned models—that each user-specified subset can be modeled by a single common process—is supported by the data. Having shown that this is not the case, we then design, implement, test, and apply an algorithm, MixtureFinder, to select the optimum number of classes for a mixture model of Q-matrices for the standard models of DNA sequence evolution. We show this algorithm performs well on simulated and empirical datasets and suggest that it may be useful for future empirical studies. MixtureFinder is available in IQ-TREE2, and a tutorial for using MixtureFinder can be found here: http://www.iqtree.org/doc/Complex-Models#mixture-models.
- 23 December 2024
- Published by Oxford University Press (OUP) in Molecular Biology and Evolution
- Vol. 42 (1)
Open AccessMixtureFinder: Estimating DNA Mixture Models for Phylogenetic Analyses
In phylogenetic studies, both partitioned models and mixture models are used to account for heterogeneity in molecular evolution among the sites of DNA sequence alignments. Partitioned models require the user to specify the grouping of sites into subsets, and then assume that each subset of sites can be modeled by a single common process. Mixture models do not require users to prespecify subsets of sites, and instead calculate the likelihood of every site under every model, while co-estimating the model weights and parameters. While much research has gone into the optimization of partitioned models by merging user-specified subsets, there has been less attention paid to the optimization of mixture models for DNA sequence alignments. In this study, we first ask whether a key assumption of partitioned models—that each user-specified subset can be modeled by a single common process—is supported by the data. Having shown that this is not the case, we then design, implement, test, and apply an algorithm, MixtureFinder, to select the optimum number of classes for a mixture model of Q-matrices for the standard models of DNA sequence evolution. We show this algorithm performs well on simulated and empirical datasets and suggest that it may be useful for future empirical studies. MixtureFinder is available in IQ-TREE2, and a tutorial for using MixtureFinder can be found here: http://www.iqtree.org/doc/Complex-Models#mixture-models.
- Open Access
MixtureFinder: Estimating DNA mixture models for phylogenetic analyses
In phylogenetic studies, both partitioned models and mixture models are used to account for heterogeneity in molecular evolution among the sites of DNA sequence alignments. Partitioned models require the user to specify the grouping of sites into subsets, and then assume that each subset of sites can be modelled by a single common process. Mixture models do not require users to pre-specify subsets of sites, and instead calculate the likelihood of every site under every model, while co-estimating the model weights and parameters. While much research has gone into the optimisation of partitioned models by merging user-specified subsets, there has been less attention paid to the optimisation of mixture models for DNA sequence alignments. In this study, we first ask whether a key assumption of partitioned models – that each user-specified subset can be modelled by a single common process – is supported by the data. Having shown that this is not the case, we then design, implement, test, and apply an algorithm, MixtureFinder, to select the optimum number of classes for a mixture model of Q matrices for the standard models of DNA sequence evolution. We show this algorithm performs well on simulated and empirical datasets and suggest that it may be useful for future empirical studies. MixtureFinder is available in IQ-TREE2, and a tutorial for using MixtureFinder can be found here: http://www.iqtree.org/doc/Complex-Models#mixture-models .
Open AccessMixtureFinder: Estimating DNA mixture models for phylogenetic analyses
In phylogenetic studies, both partitioned models and mixture models are used to account for heterogeneity in molecular evolution among the sites of DNA sequence alignments. Partitioned models require the user to specify the grouping of sites into subsets, and then assume that each subset of sites can be modelled by a single common process. Mixture models do not require users to pre-specify subsets of sites, and instead calculate the likelihood of every site under every model, while co-estimating the model weights and parameters. While much research has gone into the optimisation of partitioned models by merging user-specified subsets, there has been less attention paid to the optimisation of mixture models for DNA sequence alignments. In this study, we first ask whether a key assumption of partitioned models – that each user-specified subset can be modelled by a single common process – is supported by the data. Having shown that this is not the case, we then design, implement, test, and apply an algorithm, MixtureFinder, to select the optimum number of classes for a mixture model of Q matrices for the standard models of DNA sequence evolution. We show this algorithm performs well on simulated and empirical datasets and suggest that it may be useful for future empirical studies. MixtureFinder is available in IQ-TREE2, and a tutorial for using MixtureFinder can be found here: http://www.iqtree.org/doc/Complex-Models#mixture-models .