Biology subjects

Lanfear, R.

Publications and source records attributed to Lanfear, R..

At least 19 recordsLinked to original sources

bioRxiv2026

Comprehensive Phylogenomic Inference of Eucalypts Reveals Taxonomic Limits through Gene Tree Concordance

Speciation can be a slow process for long-lived organisms with large populations due to persistent incomplete lineage sorting, while hybridisation can further obscure species boundaries through admixture. In eucalypts, there is tremendous morphological and environmental variation with almost a thousand described species, subspecies, and hybrid taxa falling into multiple subgenera and intermediate sections. Multilocus molecular studies have generated concatenated species trees supporting deeper divergence between the Corymbia + Blakella + Angophora clade with the rest of eucalypts. However, the proportion of gene trees that recover the concatenated tree topology, including the taxonomic relationships among individual subgenera and sections, remains underappreciated. In this study, we assessed the predictive power of current eucalypt taxonomy - represented as a concatenated tree - in explaining topological variation across gene trees. To do this, we first extracted 1,187 BUSCO loci from short-read data of 701 samples representing roughly 500 described species using CAPTUS. We then inferred individual gene trees and a concatenated species tree using IQ-TREE2. Finally, we calculated the concordance factors for every described subgenus and section on the concatenated tree, and developed a taxonomic consistency test that tracks the taxonomic placement of each sample across gene trees. We show that, even though most taxonomic groups are monophyletic on the concatenated tree with 100% bootstrap support, several groups exhibit very low concordance, indicating that most gene trees do not recover their relationships as represented by the concatenated tree. These results highlight important considerations for current eucalypt taxonomic classification and provide a phylogenomic inference pipeline that can be applied not only to future eucalypt studies, but also to other evolutionarily complex groups of taxa.

evolutionary biology↗

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

PhyloRBT: A Phylogenetic Approach to Detect Reference Bias in Phylogenomic Datasets

Recent technological advancements have enabled the rapid generation of high-quality genomes across the tree of life, often resulting in multiple reference genomes for clades of phylogenetic interest. These reference genomes are often used to reconstruct phylogenetically informative loci from short-read data of newly-sequenced species. However, this approach can introduce reference bias where the reconstructed loci have erroneous similarities to those of the reference genome. Since reference bias can seriously affect downstream analyses, it is important to assess its presence in phylogenomic datasets. In this study, we propose PhyloRBT (phylogenetic reference bias test) to detect reference bias by reconstructing each locus multiple times using different reference genomes and then measuring the phylogenetic correlation between these reconstructions and the corresponding locus from the reference genomes. We applied PhyloRBT to hundreds of BUSCO loci reconstructed from short-read data of nine Eucalyptus species using 34 different reference genomes. Across the nine species, we found that more than a quarter of the reconstructed loci had significant evidence of reference bias. Excluding putatively biased loci from species tree inference resulted in a species tree topology that is more consistent with expectations from previous studies. In conclusion, PhyloRBT offers a straightforward way to detect reference bias in individual loci, and to selectively remove those biased loci from downstream analyses.

bioinformatics↗

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

New approaches to detecting and characterizing introgression in large species trees

Many current phylogeny-based methods to detect introgression use samples of species-quartets to detect asymmetries in gene tree frequencies. While this has proven to be an accurate and robust approach, applying it to larger species trees often means having to test dozens to hundreds of quartets across a tree. Furthermore, any single introgression event can have effects on multiple quartets--with no principled way to determine the number of unique events from a set of quartets--and the direction of introgression cannot always be determined from quartet comparisons alone. Here, we present a new approach to detecting introgression using the frequency with which more distantly related clades are attached to one another among a set of gene trees. Testing for introgression between pairs of branches is straightforward using these discordant attachment frequencies. We further show that the direction of introgression can be inferred between any pair of branches separated by at least two internal branches of the species tree, and that theoretical expectations of gene tree frequencies under introgression can be used to accurately determine the number of independent times genes have been exchanged. Application of these methods to data from cichlids and Drosophila demonstrate the power of the new approaches. The DAFT software package is available from: https://github.com/smishra677/DAFT/

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↗

bioRxiv2026

Using Variable Window Sizes for Phylogenomic Analyses of Whole Genome Alignments

AO_SCPLOWBSTRACTC_SCPLOWMany phylogenomic studies used non-overlapping windows to address gene tree discordance across a set of aligned genomes. Recently, Ivan et al. (2025) proposed an information theoretic approach to choose an optimal window size given the alignment. However, this approach selects only a single fixed window size per chromosome, which is a useful first step but fails to account for variation in the size of non-recombining regions along each chromosome. In this study, we extend the approach of Ivan et al. (2025) and propose PhyloNOW (phylogenomic non-overlapping windows) that allows window sizes to vary across the chromosome. We show that PhyloNOW outperforms the fixed-size approach on a wide range of simulated datasets. Applying the new method on two empirical datasets from Heliconius butterflies and great apes, we show that window sizes vary substantially across chromosomes. Our study highlights the limitations of using a fixed window size in non-overlapping window analyses, and proposes PhyloNOW that allows for variable window sizes across whole genome alignments. PhyloNOW is available at https://github.com/jeremiasivan/PhyloNOW.

bioinformatics↗

bioRxiv2025

Robust Phylogenetics

We present a robust phylogenetic inference method, called the trimmed log-likelihood method, which effectively identifies fast-evolving, saturated, or erroneous sites in both simulated and empirical multiple sequence alignments. This method avoids circularity by dynamically identifying and removing sites without relying on an initial tree, allowing the specific sites removed to change as tree topology and branch lengths are estimated. Our analyses demonstrate that this method outperforms existing approaches, such as the Slow-Fast method, Tree Independent Generation of Evolutionary Rate approach, and Le Quesne Probability statistics, by removing fewer sites while still inferring phylogenies with comparable or greater accuracy. Implemented in IQ-TREE2, the trimmed log-likelihood method is user-friendly with a simple command-line interface. However, challenges remain in addressing heterogeneous evolutionary processes including compositional biases, such as GC bias. Despite these challenges, our approach offers a practical solution for improving phylogenetic inference by automatically and dynamically identifying sites to down-weight during phylogenetic analyses. We recommended that researchers compare trees inferred by varying the proportion of down-weighted sites to monitor changes in tree topology and to identify a set of candidate tree topologies for further consideration.

evolutionary biology↗

bioRxiv2025

Selecting a Window Size for the Analysis of Whole Genome Alignments using AIC

AO_SCPLOWBSTRACTC_SCPLOWThe variation of evolutionary histories along the genome presents a challenge for phylogenomic methods to identify the non-recombining regions and reconstruct the phylogenetic tree for each region. To address this problem, many studies used the non-overlapping window approach, often with an arbitrary selection of fixed window sizes that potentially include intra-window recombination events. In this study, we proposed an information theoretic approach to select a window size that best reflects the underlying histories of the alignment. First, we simulated chromosome alignments that reflected the key characteristics of an empirical dataset and found that the AIC is a good predictor of window size accuracy in correctly recovering the tree topologies of the alignment. Due to the issue of missing data in empirical datasets, we then designed a stepwise non-overlapping window approach and applied this method to the genomes of erato-sara Heliconius butterflies and great apes. We found that the best window sizes for the butterflies chromosomes ranged from <125bp to 250bp, which are much shorter than those used in a previous study even though this difference in window size did not significantly change the most common topologies across the genome. On the other hand, the best window sizes for great apes chromosomes ranged from 500bp to 1kb with the proportion of the major topology (grouping human and chimpanzee) falling between 60% and 87%, consistent with previous findings. Additionally, we observed a notable impact of stochastic error and concatenation when using small and large windows, respectively. For instance, the proportion of the major topology for great apes was 50% when using 250bp windows, but reached almost 100% for 64kb windows. In conclusion, our study highlights the challenges associated with selecting a window size in non-overlapping window analyses and proposes the AIC as a more objective way to select the optimal window size for whole genome alignments.

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↗

bioRxiv2022

Updated site concordance factors minimize effects of homoplasy and taxon sampling

MotivationSite concordance factors (sCFs) have become a widely used way to summarize discordance in phylogenomic datasets. However, the original version of sCFs were calculated by sampling a quartet of tip taxa and then applying parsimony-based criteria for discordance. This approach has the potential to be strongly affected by multiple hits at a site (homoplasy), especially when substitution rates are high or taxa are not closely related. ResultsHere, we introduce a new method for calculating site concordance factors. The updated version uses likelihood to generate probability distributions of ancestral states at internal nodes of the phylogeny. By sampling from the states at internal nodes adjacent to a given branch, this approach substantially reduces--but does not completely abolish--the effects of homoplasy and taxon sampling. Availability and implementationUpdated sCFs are implemented in IQ-TREE 2.2.2. The software is freely available at https://github.com/iqtree/iqtree2/releases. Contactmoyu@iu.edu

bioinformatics↗

bioRxiv2022

DecentTree: Scalable Neighbour-Joining for the Genomic Era

SummaryNeighbour-Joining is one of the most widely used distance-based phylogenetic inference methods. However, current implementations do not scale well for datasets with more than 10,000 sequences. Given the increasing pace of generating new sequence data, particularly in outbreaks of emerging diseases, and the already enormous existing databases of sequence data for which NJ is a useful approach, new implementations of existing methods are warranted. Here we present DecentTree, which provides highly optimised and parallel implementations of Neighbour-Joining and several of its variants. DecentTree is designed as a stand-alone application and a header-only library easily integrated with other phylogenetic software (e.g. it is integral in the popular IQ-TREE software). We show that DecentTree shows similar or improved performance over existing software (BIONJ, Quicktree, FastME, and RapidNJ), especially for handling very large alignments. For example, DecentTree is up to 6-fold faster than the fastest existing Neighbour-Joining software (e.g. RapidNJ) when generating a tree of 64,000 SARS-CoV-2 genomes. Availability and implementationDecentTree is open source and freely available at https://github.com/iqtree/decenttree. ContactMinh Bui: m.bui@anu.edu.au; Robert Lanfear: rob.lanfear@anu.edu.au Supplementary informationSupplementary data are available at Bioinformatics online.

evolutionary biology↗

bioRxiv2022

matOptimize: A parallel tree optimization method enables online phylogenetics for SARS-CoV-2

Phylogenetic tree optimization is necessary for precise analysis of evolutionary and transmission dynamics, but existing tools are inadequate for handling the scale and pace of data produced during the COVID-19 pandemic. One transformative approach, online phylogenetics, aims to incrementally add samples to an ever-growing phylogeny, but there are no previously-existing approaches that can efficiently optimize this vast phylogeny under the time constraints of the pandemic. Here, we present matOptimize, a fast and memory-efficient phylogenetic tree optimization tool based on parsimony that can be parallelized across multiple CPU threads and nodes, and provides orders of magnitude improvement in runtime and peak memory usage compared to existing state-of-the-art methods. We have developed this method particularly to address the pressing need during the COVID-19 pandemic for daily maintenance and optimization of a comprehensive SARS-CoV-2 phylogeny. Thus, our approach addresses an important need for daily maintenance and refinement of a comprehensive SARS-CoV-2 phylogeny. Significance StatementPhylogenetic trees have been central to genomic surveillance, epidemiology, and contact tracing efforts during the COVD-19 pandemic. With over 6 million SARS-CoV-2 genome sequences now available, maintaining an accurate, comprehensive phylogenetic tree of all available SARS-CoV-2 sequences is becoming computationally infeasible with existing software, but is essential for getting a detailed picture of the virus evolution and transmission. Our novel phylogenetic software, matOptimize, is helping refine possibly the largest-ever phylogenetic tree, containing millions of SARS-CoV-2 sequences, thus providing an unprecedented resolution for studying the pathogens evolutionary and transmission dynamics.

evolutionary biology↗

bioRxiv2021

AliSim: A Fast and Versatile Phylogenetic Sequence Simulator For the Genomic Era

Sequence simulators play an important role in phylogenetics. Simulated data has many applications, such as evaluating the performance of different methods, hypothesis testing with parametric bootstraps, and, more recently, generating data for training machine-learning applications. Many sequence simulation programs exist, but the most feature-rich programs tend to be rather slow, and the fastest programs tend to be feature-poor. Here, we introduce AliSim, a new tool that can efficiently simulate biologically realistic alignments under a large range of complex evolutionary models. To achieve high performance across a wide range of simulation conditions, AliSim implements an adaptive approach that combines the commonly-used rate matrix and probability matrix approach. AliSim takes 1.3 hours and 1.3 GB RAM to simulate alignments with one million sequences or sites, while popular software Seq-Gen, Dawg, and INDELible require two to five hours and 50 to 500 GB of RAM. We provide AliSim as an extension of the IQ-TREE software version 2.2, freely available at www.iqtree.org, and a comprehensive user tutorial at http://www.iqtree.org/doc/AliSim.

bioinformatics↗

bioRxiv2021

Online Phylogenetics using Parsimony Produces Slightly Better Trees and is Dramatically More Efficient for Large SARS-CoV-2 Phylogenies than de novo and Maximum-Likelihood Approaches

Phylogenetics has been foundational to SARS-CoV-2 research and public health policy, assisting in genomic surveillance, contact tracing, and assessing emergence and spread of new variants. However, phylogenetic analyses of SARS-CoV-2 have often relied on tools designed for de novo phylogenetic inference, in which all data are collected before any analysis is performed and the phylogeny is inferred once from scratch. SARS-CoV-2 datasets do not fit this mould. There are currently over 10 million sequenced SARS-CoV-2 genomes in online databases, with tens of thousands of new genomes added every day. Continuous data collection, combined with the public health relevance of SARS-CoV-2, invites an "online" approach to phylogenetics, in which new samples are added to existing phylogenetic trees every day. The extremely dense sampling of SARS-CoV-2 genomes also invites a comparison between likelihood and parsimony approaches to phylogenetic inference. Maximum likelihood (ML) methods are more accurate when there are multiple changes at a single site on a single branch, but this accuracy comes at a large computational cost, and the dense sampling of SARS-CoV-2 genomes means that these instances will be extremely rare because each internal branch is expected to be extremely short. Therefore, it may be that approaches based on maximum parsimony (MP) are sufficiently accurate for reconstructing phylogenies of SARS-CoV-2, and their simplicity means that they can be applied to much larger datasets. Here, we evaluate the performance of de novo and online phylogenetic approaches, and ML and MP frameworks, for inferring large and dense SARS-CoV-2 phylogenies. Overall, we find that online phylogenetics produces similar phylogenetic trees to de novo analyses for SARS-CoV-2, and that MP optimizations produce more accurate SARS-CoV-2 phylogenies than do ML optimizations. Since MP is thousands of times faster than presently available implementations of ML and online phylogenetics is faster than de novo, we therefore propose that, in the context of comprehensive genomic epidemiology of SARS-CoV-2, MP online phylogenetics approaches should be favored.

bioinformatics↗

bioRxiv2021

nQMaker: estimating time non-reversible amino acid substitution models

Amino acid substitution models are a key component in phylogenetic analyses of protein sequences. All amino acid models available to date are time-reversible, an assumption designed for computational convenience but not for biological reality. Another significant downside to time-reversible models is that they do not allow inference of rooted trees without outgroups. In this paper, we introduce a maximum likelihood approach nQMaker, an extension of the recently published QMaker method, that allows the estimation of time non-reversible amino acid substitution models and rooted phylogenetic trees from a set of protein sequence alignments. We show that the non-reversible models estimated with nQMaker are a much better fit to empirical alignments than pre-existing reversible models, across a wide range of datasets including mammals, birds, plants, fungi, and other taxa, and that the improvements in model fit scale with the size of the dataset. Notably, for the recently published plant and bird trees, these non-reversible models correctly recovered the commonly known root placements with very high statistical support without the need to use an outgroup. We provide nQMaker as an easy-to-use feature in the IQ-TREE software (http://www.iqtree.org), allowing users to estimate non-reversible models and rooted phylogenies from their own protein datasets.

bioinformatics↗