Taoyang Wu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Taoyang Wu has a total of 162 co-authors. Here are the top co-authors by number of shared publications:
- Vincent Moulton
School of Computing Sciences, University of East Anglia, Norwich, UK
36 shared publications Andreas Spillner
7 shared publications- Katharina T. Huber
School of Computing Sciences, University of East Anglia, Norwich, UK
7 shared publications - Kwok Pui Choi
NATIONAL UNIVERSITY OF SINGAPORE Singapore
7 shared publications - Charles Semple
School of Mathematics and Statistics, University of Canterbury, Christchurch, New Zealand
4 shared publications - Katharina T. Huber
University of East Anglia, Norwich, UK
4 shared publications
Latest Publications
- Open Access
- 7 October 2026
- Published by Wiley in Evolutionary Applications
- Vol. 19 (10) , e70331
Machine‐Learning Models Trained on Genomic Summary Statistics Assess Extinction Risk and Recovery Potential of Bottlenecked Populations
Forecasting extinction risk from genomic data is challenging because of interactions among environment, demography, and genomic erosion. Here, we use known outcomes from forward simulations as a proof‐of‐concept study to test whether machine‐learning (ML) models can discriminate relative extinction risk and recovery potential from genomic summary statistics, and identify the most informative predictors. Using individual‐based, forward‐in‐time simulations, we generated genomic and fitness data for 11,200 populations across 112 demographic parameter combinations (ancestral population size: 100–10,000, bottleneck size: 4–50, fecundity: 8–64). We evaluated populations at three time points relative to bottleneck onset: 100 years before, 10 years before and at onset. We then assessed their subsequent fate up to 200 years after the end of the bottleneck, classifying populations as extinct or recovered. From 10 sampled individuals per population, we derived 738 predictors spanning diversity, heterozygosity, genetic/realised/masked load, and ROH‐based inbreeding (FROH). Unsupervised analyses primarily captured historical demography and did not separate outcomes. In contrast, supervised models achieved high performance at bottleneck onset, correctly predicting population fate (i.e., future extinction or recovery) from genomics alone with ≈86%–87% accuracy. However, extinction was harder to predict correctly than recovery because simulated extinctions were rarer. Bottleneck size and fecundity provided strong baseline predictability, with genomics adding modest but complementary information. The upper‐quantile ROH/FROH summaries were consistently more informative than mean diversity or mean load. A complementary single‐genome analysis showed that reference‐genome‐style summaries retain useful signal when demographic information is sparse. Together, these results highlight the promise of ML‐informed extinction‐risk assessment to translate genomic indicators into more actionable, early‐warning signals for biodiversity conservation.
- 7 October 2026
- Published by Wiley in Evolutionary Applications
- Vol. 19 (10) , e70331
Open AccessMachine‐Learning Models Trained on Genomic Summary Statistics Assess Extinction Risk and Recovery Potential of Bottlenecked Populations
Forecasting extinction risk from genomic data is challenging because of interactions among environment, demography, and genomic erosion. Here, we use known outcomes from forward simulations as a proof‐of‐concept study to test whether machine‐learning (ML) models can discriminate relative extinction risk and recovery potential from genomic summary statistics, and identify the most informative predictors. Using individual‐based, forward‐in‐time simulations, we generated genomic and fitness data for 11,200 populations across 112 demographic parameter combinations (ancestral population size: 100–10,000, bottleneck size: 4–50, fecundity: 8–64). We evaluated populations at three time points relative to bottleneck onset: 100 years before, 10 years before and at onset. We then assessed their subsequent fate up to 200 years after the end of the bottleneck, classifying populations as extinct or recovered. From 10 sampled individuals per population, we derived 738 predictors spanning diversity, heterozygosity, genetic/realised/masked load, and ROH‐based inbreeding (FROH). Unsupervised analyses primarily captured historical demography and did not separate outcomes. In contrast, supervised models achieved high performance at bottleneck onset, correctly predicting population fate (i.e., future extinction or recovery) from genomics alone with ≈86%–87% accuracy. However, extinction was harder to predict correctly than recovery because simulated extinctions were rarer. Bottleneck size and fecundity provided strong baseline predictability, with genomics adding modest but complementary information. The upper‐quantile ROH/FROH summaries were consistently more informative than mean diversity or mean load. A complementary single‐genome analysis showed that reference‐genome‐style summaries retain useful signal when demographic information is sparse. Together, these results highlight the promise of ML‐informed extinction‐risk assessment to translate genomic indicators into more actionable, early‐warning signals for biodiversity conservation.
- 17 September 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 334
GADTI: A geometry-aware dual-tower framework for drug-target interaction prediction
- 17 September 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 334
GADTI: A geometry-aware dual-tower framework for drug-target interaction prediction
- Open Access
Asymptotic Enumeration of Subclasses of Level-$2$ Phylogenetic Networks
This paper studies the enumeration of seven subclasses of level-$2$ phylogenetic networks under various planarity and structural constraints, including terminal planar, tree-child, and galled networks. We derive their exponential generating functions, recurrence relations, and asymptotic formulas. Specifically, we show that the number of networks of size $n$ in each class follows: \[ N_n \sim c \cdot n^{n-1} \cdot γ^n, \] where $c$ is a class-specific constant and $γ$ is the corresponding growth rate. Our results reveal that being terminal planar can significantly reduce the growth rate of general level-2 networks, but has only a minor effect on the growth rates of tree-child and galled level-2 networks. Notably, the growth rate of 3.83 for level-$2$ terminal planar galled tree-child networks is remarkably close to the rate of 2.94 for level-$1$ networks.Open AccessAsymptotic Enumeration of Subclasses of Level-$2$ Phylogenetic Networks
This paper studies the enumeration of seven subclasses of level-$2$ phylogenetic networks under various planarity and structural constraints, including terminal planar, tree-child, and galled networks. We derive their exponential generating functions, recurrence relations, and asymptotic formulas. Specifically, we show that the number of networks of size $n$ in each class follows: \[ N_n \sim c \cdot n^{n-1} \cdot γ^n, \] where $c$ is a class-specific constant and $γ$ is the corresponding growth rate. Our results reveal that being terminal planar can significantly reduce the growth rate of general level-2 networks, but has only a minor effect on the growth rates of tree-child and galled level-2 networks. Notably, the growth rate of 3.83 for level-$2$ terminal planar galled tree-child networks is remarkably close to the rate of 2.94 for level-$1$ networks. - Open Access
P3ANUT: An enhanced DNA sequencing analysis platform for uncovering and correcting errors in peptide display library screening
Display technologies are used extensively in the discovery of peptides and antibodies towards the development of new medicines and diagnostic tools. Phage display technology enables the filtering of 10 random peptides/antibodies down to and enriched pool of candidates with favourable binding affinities. In recent years, next-generation DNA sequencing technologies have increased the precision and accuracy with which the peptide sequences of phage display library clones are identified. Inaccuracies in DNA sequencing such as substitutions, insertions and deletions in the library oligonucleotide region have the potential to result in the identification of erroneous candidate sequences. Here, we describe a P ython P ipeline for P hage A nalysis through a N ormative U nified T oolset (P3ANUT) which employs Levenshtein distance, k-mer approaches and a novel encoding scheme on paired-end sequencing outputs to correct sequencing errors from next-generation sequencing outputs of display library screens. We introduce an easy-to-use and highly customisable computational tool with graphical user- and command line interfaces to process entire datasets within a single input, as well as visualisation tools for candidate analysis and data generation. P3ANUT shows significant improvements in read recovery, overall read quality, and runtime compared to a previously published pipeline. GRAPHICAL
Open AccessP3ANUT: An enhanced DNA sequencing analysis platform for uncovering and correcting errors in peptide display library screening
Display technologies are used extensively in the discovery of peptides and antibodies towards the development of new medicines and diagnostic tools. Phage display technology enables the filtering of 10 random peptides/antibodies down to and enriched pool of candidates with favourable binding affinities. In recent years, next-generation DNA sequencing technologies have increased the precision and accuracy with which the peptide sequences of phage display library clones are identified. Inaccuracies in DNA sequencing such as substitutions, insertions and deletions in the library oligonucleotide region have the potential to result in the identification of erroneous candidate sequences. Here, we describe a P ython P ipeline for P hage A nalysis through a N ormative U nified T oolset (P3ANUT) which employs Levenshtein distance, k-mer approaches and a novel encoding scheme on paired-end sequencing outputs to correct sequencing errors from next-generation sequencing outputs of display library screens. We introduce an easy-to-use and highly customisable computational tool with graphical user- and command line interfaces to process entire datasets within a single input, as well as visualisation tools for candidate analysis and data generation. P3ANUT shows significant improvements in read recovery, overall read quality, and runtime compared to a previously published pipeline. GRAPHICAL
- Open Access
- 16 March 2024
- Published by Elsevier in Journal of Theoretical Biology
- Vol. 584, 111794
Distributions of 4-subtree patterns for uniform random unrooted phylogenetic trees
- 16 March 2024
- Published by Elsevier in Journal of Theoretical Biology
- Vol. 584, 111794
Open AccessDistributions of 4-subtree patterns for uniform random unrooted phylogenetic trees
- Open Access
- 20 January 2023
- Published by Wiley in New Phytologist
- Vol. 237 (6) , 2210-2223
CIPK‐B is essential for salt stress signalling in Marchantia polymorpha
Summary: Calcium signalling is central to many plant processes, with families of calcium decoder proteins having expanded across the green lineage and redundancy existing between decoders. The liverwort Marchantia polymorpha has fast become a new model plant, but the calcium decoders that exist in this species remain unclear. We performed phylogenetic analyses to identify the calcineurin B‐like (CBL) and CBL‐interacting protein kinase (CIPK) network of M. polymorpha. We analysed CBL‐CIPK expression during salt stress, and determined protein–protein interactions using yeast two‐hybrid and bimolecular fluorescence complementation. We also created genetic knockouts using CRISPR/Cas9. We confirm that M. polymorpha has two CIPKs and three CBLs. Both CIPKs and one CBL show pronounced salt‐responsive transcriptional changes. All M. polymorpha CBL‐CIPKs interact with each other in planta. Knocking out CIPK‐B causes increased sensitivity to salt, suggesting that this CIPK is involved in salt signalling. We have identified CBL‐CIPKs that form part of a salt tolerance pathway in M. polymorpha. Phylogeny and interaction studies imply that these CBL‐CIPKs form an evolutionarily conserved salt overly sensitive pathway. Hence, salt responses may be some of the early functions of CBL‐CIPK networks and increased abiotic stress tolerance required for land plant emergence.
- 20 January 2023
- Published by Wiley in New Phytologist
- Vol. 237 (6) , 2210-2223
Open AccessCIPK‐B is essential for salt stress signalling in Marchantia polymorpha
Summary: Calcium signalling is central to many plant processes, with families of calcium decoder proteins having expanded across the green lineage and redundancy existing between decoders. The liverwort Marchantia polymorpha has fast become a new model plant, but the calcium decoders that exist in this species remain unclear. We performed phylogenetic analyses to identify the calcineurin B‐like (CBL) and CBL‐interacting protein kinase (CIPK) network of M. polymorpha. We analysed CBL‐CIPK expression during salt stress, and determined protein–protein interactions using yeast two‐hybrid and bimolecular fluorescence complementation. We also created genetic knockouts using CRISPR/Cas9. We confirm that M. polymorpha has two CIPKs and three CBLs. Both CIPKs and one CBL show pronounced salt‐responsive transcriptional changes. All M. polymorpha CBL‐CIPKs interact with each other in planta. Knocking out CIPK‐B causes increased sensitivity to salt, suggesting that this CIPK is involved in salt signalling. We have identified CBL‐CIPKs that form part of a salt tolerance pathway in M. polymorpha. Phylogeny and interaction studies imply that these CBL‐CIPKs form an evolutionarily conserved salt overly sensitive pathway. Hence, salt responses may be some of the early functions of CBL‐CIPK networks and increased abiotic stress tolerance required for land plant emergence.
- Open Access
- 22 December 2022
- Published by Elsevier in Theoretical Population Biology
- Vol. 149, 27-38
Distributions of cherries and pitchforks for the Ford model
- 22 December 2022
- Published by Elsevier in Theoretical Population Biology
- Vol. 149, 27-38
Open AccessDistributions of cherries and pitchforks for the Ford model
- Open Access
SPRINT: A fast, new software tool for reconstructing the evolutionary past of polyploid datasets
Polyploidization is an important evolutionary process which affects organisms ranging from plants to fish and fungi. The signal left behind by it is in the form of a species' ploidy level (number of complete chromosome sets found in a cell) which is inherently non-treelike. Currently available tools for reconstructing the evolutionary past of a polyploid dataset generally start with a multi-labelled tree obtained for a dataset of interest and then derive a (phylogenetic) network from that tree in some way that reflects that past by interpreting the networks's vertices of indegree at least two as polyploidization events. Since obtaining such a tree can be computationally expensive it is paramount to have alternative approaches available that allow one to shed light into the reticulate evolutionary past of a polyploid dataset. SPRINT aims to reconstruct the evolutionary past of a polyploid dataset in terms of a binary network which realises the dataset's ploidy profile (vector of ploidy levels of the dataset's taxa) and requires the fewest number of polyploidization events. It does this by representing the ploidy level of a species x in terms of the number of directed paths from the root of the network to the leaf of the network labelled by x. SPRINT is distributed on GitHub: https://github.com/lmaher1/SPRINT.
Open AccessSPRINT: A fast, new software tool for reconstructing the evolutionary past of polyploid datasets
Polyploidization is an important evolutionary process which affects organisms ranging from plants to fish and fungi. The signal left behind by it is in the form of a species' ploidy level (number of complete chromosome sets found in a cell) which is inherently non-treelike. Currently available tools for reconstructing the evolutionary past of a polyploid dataset generally start with a multi-labelled tree obtained for a dataset of interest and then derive a (phylogenetic) network from that tree in some way that reflects that past by interpreting the networks's vertices of indegree at least two as polyploidization events. Since obtaining such a tree can be computationally expensive it is paramount to have alternative approaches available that allow one to shed light into the reticulate evolutionary past of a polyploid dataset. SPRINT aims to reconstruct the evolutionary past of a polyploid dataset in terms of a binary network which realises the dataset's ploidy profile (vector of ploidy levels of the dataset's taxa) and requires the fewest number of polyploidization events. It does this by representing the ploidy level of a species x in terms of the number of directed paths from the root of the network to the leaf of the network labelled by x. SPRINT is distributed on GitHub: https://github.com/lmaher1/SPRINT.
- Open Access
CIPK-B is essential for salt stress signalling in Marchantia polymorpha
SUMMARY: Calcium signalling is central to many plant processes, with families of calcium decoder proteins having expanded across the green lineage and redundancy existing between decoders. The liverwort Marchantia polymorpha has fast become a new model plant, but it is unclear what calcium decoders exist in this species. We have performed phylogenetic analyses to identify the Calcineurin B-Like (CBL) and CBL-Interacting Protein Kinase (CIPK) network of M. polymorpha . We analysed CBL-CIPK expression during salt stress, and determined protein-protein interactions using yeast two-hybrid and bimolecular fluorescence complementation. We also created genetic knockouts using CRISPR/Cas9. We confirm that M. polymorpha has two CIPKs and three CBLs. Both CIPKs and only one CBL show salt-responsive transcriptional changes. All M. polymorpha CBL-CIPKs interact with each other in planta . Knocking out CIPK-B causes increased sensitivity to salt suggesting that this CIPK is involved in salt signalling. We have identified CBL-CIPKs that form part of a salt tolerance pathway in M. polymorpha . Phylogeny and interaction studies imply that these CBL-CIPKs form an evolutionarily conserved Salt Overly Sensitive (SOS) pathway. Hence, salt responses may be some of the early functions of CBL-CIPK networks and increased abiotic stress tolerance required for land plant emergence.
Open AccessCIPK-B is essential for salt stress signalling in Marchantia polymorpha
SUMMARY: Calcium signalling is central to many plant processes, with families of calcium decoder proteins having expanded across the green lineage and redundancy existing between decoders. The liverwort Marchantia polymorpha has fast become a new model plant, but it is unclear what calcium decoders exist in this species. We have performed phylogenetic analyses to identify the Calcineurin B-Like (CBL) and CBL-Interacting Protein Kinase (CIPK) network of M. polymorpha . We analysed CBL-CIPK expression during salt stress, and determined protein-protein interactions using yeast two-hybrid and bimolecular fluorescence complementation. We also created genetic knockouts using CRISPR/Cas9. We confirm that M. polymorpha has two CIPKs and three CBLs. Both CIPKs and only one CBL show salt-responsive transcriptional changes. All M. polymorpha CBL-CIPKs interact with each other in planta . Knocking out CIPK-B causes increased sensitivity to salt suggesting that this CIPK is involved in salt signalling. We have identified CBL-CIPKs that form part of a salt tolerance pathway in M. polymorpha . Phylogeny and interaction studies imply that these CBL-CIPKs form an evolutionarily conserved Salt Overly Sensitive (SOS) pathway. Hence, salt responses may be some of the early functions of CBL-CIPK networks and increased abiotic stress tolerance required for land plant emergence.
- 23 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Computational Biology and Bioinformatics
- Vol. 20 (2) , 1289-1297
Planar Rooted Phylogenetic Networks
A rooted phylogenetic network is a directed acyclic graph with a single root, whose sinks correspond to a set of species. As such networks are useful for representing the evolution of species that have undergone reticulate evolution, there has been great interest in developing the theory behind and algorithms for constructing them. However, unlike evolutionary trees, these networks can be highly non-planar, which can make them difficult to visualise and interpret. Here we investigate properties of planar rooted phylogenetic networks and algorithms for deciding whether or not rooted networks have certain special planarity properties. In particular, we introduce three natural subclasses of planar rooted phylogenetic networks and show that they form a hierarchy. In addition, for the well-known level-k networks, we show that level-1, -2, -3 networks are always outer, terminal, and upward planar, respectively, and that level-4 networks are not necessarily planar. Finally, we show that a regular network is terminal planar if and only if it is pyramidal. Our results make use of the highly developed field of planar digraphs, and we believe that the link between phylogenetic networks and planar graphs should prove useful in future for developing new approaches to both construct and visualise phylogenetic networks.
- 23 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Computational Biology and Bioinformatics
- Vol. 20 (2) , 1289-1297
Planar Rooted Phylogenetic Networks
A rooted phylogenetic network is a directed acyclic graph with a single root, whose sinks correspond to a set of species. As such networks are useful for representing the evolution of species that have undergone reticulate evolution, there has been great interest in developing the theory behind and algorithms for constructing them. However, unlike evolutionary trees, these networks can be highly non-planar, which can make them difficult to visualise and interpret. Here we investigate properties of planar rooted phylogenetic networks and algorithms for deciding whether or not rooted networks have certain special planarity properties. In particular, we introduce three natural subclasses of planar rooted phylogenetic networks and show that they form a hierarchy. In addition, for the well-known level-k networks, we show that level-1, -2, -3 networks are always outer, terminal, and upward planar, respectively, and that level-4 networks are not necessarily planar. Finally, we show that a regular network is terminal planar if and only if it is pyramidal. Our results make use of the highly developed field of planar digraphs, and we believe that the link between phylogenetic networks and planar graphs should prove useful in future for developing new approaches to both construct and visualise phylogenetic networks.