Biology subjects

Wong, T. K. F.

Publications and source records attributed to Wong, T. K. F..

8 recordsLinked to original sources

bioRxiv2026

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.

evolutionary biology↗

bioRxiv2026

GTRspmix: Capturing Heterogeneity of Exchangeabilities Across Sites to Improve Protein Phylogenetics

Site rate and profile mixture models capture the heterogeneity of the amino acid substitution process across sites. However, these models typically use a single matrix of amino acid exchangeabilities and ignore potential heterogeneities of these exchangeabilities across sites. Simply combining multiple exchangeability matrices with rate and profile mixtures leads to a combinatorial explosion of mixture components and a prohibitive increase in free parameters. Here, we introduce GTRspmix, a novel framework that incorporates multiple exchangeability matrices into profile and site rate mixture models while effectively managing model complexity. GTRspmix employs a clustering-based strategy that groups profiles and assigns a distinct exchangeability matrix to each profile cluster. Evaluations using both empirical and simulated datasets demonstrate that GTRspmix fits empirical data significantly better than conventional models, and that overparameterization does not present a problem for sufficiently large alignments. Based on these results, we estimated general-purpose empirical models (SXXpfamCYY series available in IQ-TREE3) from the Pfam database. These general-purpose models not only fit data much better, but they also influence branch length and tree topology estimates, effectively mitigating long-branch attraction artifacts. Because the total number of rate matrices remains manageable, the computational efficiency of the inference is identical to that of conventional profile mixture models (e.g., LG+C60+G4). GTRspmix provides a more realistic and flexible model of protein evolution, offering a robust foundation for the inference of reliable phylogenetic trees.

evolutionary biology↗

bioRxiv2026

A New Information Theoretic Approach Shows that Mixture Models Outperform Partitioned Models for Phylogenetic Analyses of Amino Acid Data

Partitioned 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 partitioned 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 partitioned 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 partitioned models across a diverse set of empirical datasets. We show that mixture models are universally favoured on amino acid datasets. This has important implications for interpreting empirical analyses and suggests that continued development of mixture models is an important avenue for future research.

evolutionary biology↗

bioRxiv2024

GTRpmix: A linked general-time reversible model for profile mixture models

Profile mixture models capture distinct biochemical constraints on the amino acid substitution process at different sites in proteins. These models feature a mixture of time-reversible models with a common set of amino acid exchange rates (a matrix of exchangeabilities) and distinct sets of equilibrium amino acid frequencies known as profiles. Combining the exchangeability matrix with each profile generates the matrix of instantaneous rates of amino acid exchange for that profile. Currently, empirically estimated exchangeability matrices (e.g., the LG or WAG matrices) are widely used for phylogenetic inference under profile mixture models. However, such matrices were originally estimated using site homogeneous models with a single set of equilibrium amino acid frequencies; therefore unlikely to be optimal for site heterogeneous profile mixture models. Here we describe the GTRpmix model, implemented in IQ-TREE2, that allows maximum likelihood estimation of a common set of exchangeabilities for all site classes under any profile mixture model. We show that exchangeability matrices estimated in the presence of a site-heterogeneous profile mixture model differ markedly from the widely used LG matrix and dramatically improve model fit and topological estimation accuracy for empirical test cases. Because the GTRpmix model is computationally expensive, we provide two exchangeability matrices estimated from large concatenated phylogenomic supermatrices under the C60 profile mixture model that can be used as fixed matrices for phylogenetic analyses. One of these, called Eukaryotic Linked Mixture (ELM), is designed for phylogenetic analysis of proteins encoded by nuclear genomes of eukaryotes, and the other, Eukaryotic and Archeal Linked mixture (EAL), for reconstructing relationships between eukaryotes and Archaea. These matrices when combined with profile mixture models fit data much better and have improved topology estimation relative to the empirical LG matrix combined with the same underlying mixture models. Version v2.3.1 of IQ-TREE2 implementing these models is available at www.iqtree.org.

molecular biology↗

bioRxiv2024

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.

evolutionary biology↗

bioRxiv2022

MAST: Phylogenetic Inference with Mixtures Across Sites and Trees

Hundreds or thousands of loci are now routinely used in modern phylogenomic studies. Concatenation approaches to tree inference assume that there is a single topology for the entire dataset, but different loci may have different evolutionary histories due to incomplete lineage sorting, introgression, and/or horizontal gene transfer; even single loci may not be treelike due to recombination. To overcome this shortcoming, we introduce the mixture across sites and trees (MAST) model, which uses a mixture of bifurcating trees to represent multiple histories in a single concatenated alignment. The MAST model allows each tree to have its own topology, branch lengths, substitution model, nucleotide or amino acid frequencies, and model of rate heterogeneity across sites. We implemented the MAST model in a maximum-likelihood framework in the popular phylogenetic software, IQ-TREE. Simulations show that we can accurately recover the true model parameters, including branch lengths and tree weights (i.e. frequencies) for a given set of tree topologies. We also show that we can use standard statistical inference approaches to reject a single-tree model when data are simulated under multiple trees (and vice versa). We applied the MAST model to multiple primate datasets and found that it can recover the signal of incomplete lineage sorting in the Great Apes, as well as the asymmetry in minor trees caused by introgression among several macaque species. When applied to a dataset of four Platyrrhine species for which standard concatenated maximum likelihood and gene tree approaches disagree, we find that MAST gives the highest weight to the tree favored by gene tree approaches. These results suggest that the MAST model is able to analyse a concatenated alignment using maximum likelihood, while avoiding some of the biases that come with assuming there is only a single tree. The MAST model can therefore offer unique biological insights when applied to datasets with multiple evolutionary histories. We discuss how it can be extended in the future.

bioinformatics↗

bioRxiv2021

An assembly-free method of phylogeny reconstruction using short-read sequences from pooled samples without barcodes

A current strategy for obtaining haplotype information from several individuals involves short-read sequencing of pooled amplicons, where fragments from each individual is identified by a unique DNA barcode. In this paper, we report a new method to recover the phylogeny of haplotypes from short-read sequences obtained using pooled amplicons from a mixture of individuals, without barcoding. The method, AFPhyloMix, accepts an alignment of the mixture of reads against a reference sequence, obtains the single-nucleotide-polymorphisms (SNP) patterns along the alignment, and constructs the phylogenetic tree according to the SNP patterns. AFPhyloMix adopts a Bayesian model of inference to estimates the phylogeny of the haplotypes and their relative frequencies, given that the number of haplotypes is known. In our simulations, AFPhyloMix achieved at least 80% accuracy at recovering the phylogenies and frequencies of the constituent haplotypes, for mixtures with up to 15 haplotypes. AFPhyloMix also worked well on a real data set of kangaroo mitochondrial DNA sequences.

bioinformatics↗

bioRxiv2018

HaploJuice : Accurate haplotype assembly from a pool of sequences with known relative concentrations

Pooling techniques, where multiple sub-samples are mixed in a single sample, are widely used to take full advantage of high-throughput DNA sequencing. Recently, Ranjard et al. [1] proposed a pooling strategy without the use of barcodes. Three sub-samples were mixed in different known proportions (i.e. 62.5%, 25% and 12.5%), and a method was developed to use these proportions to reconstruct the three haplotypes effectively. HaploJuice provides an alternative haplotype reconstruction algorithm for Ranjard et al.s pooling strategy. HaploJuice significantly increases the accuracy by first identifying the empirical proportions of the three mixed sub-samples and then assembling the haplotypes using a dynamic programming approach. HaploJuice was evaluated against five different assembly algorithms, Hmmfreq [1], ShoRAH [2], SAVAGE [3], PredictHaplo [4] and QuRe [5]. Using simulated and real data sets, HaploJuice reconstructed the true sequences with the highest coverage and the lowest error rate. HaploJuice achieves high accuracy in haplotype reconstruction, making Ranjard et al.s pooling strategy more efficient, feasible, and applicable, with the benefit of reducing the sequencing cost.

bioinformatics↗