Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Heather A. Harrington

dblp:77/9585 · DBLP profile ↗
← Back
9ranked-venue papers
0as first author
6since 2021 · last 2026
0000-0002-1705-7869ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 6 · 4 since 2021Artificial intelligence and machine learning · 2 · 1 since 2021Theory of computation · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 100%
Artificial intelligence
1 paper
Representation and self-supervised learning · 100%
Theoretical computer science
1 paper
Computational geometry · 100%

Topics — the 6 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction
manifold learning
0.912025
Cover learning for large-scale topology representation · ICML 2025
Machine learning › Representation and self-supervised learning
topological representation
0.912025
Cover learning for large-scale topology representation · ICML 2025
Computational geometry › topological data analysis
simplicial complexes
0.912025
Cover learning for large-scale topology representation · ICML 2025
Computational geometry
topological data analysis
0.912025
Cover learning for large-scale topology representation · ICML 2025
Bioinformatics and computational biology
approximate bayesian computation
0.612022
Topological approximate Bayesian computation for parameter inference of an angiogenesis model · Bioinform. 2022
Bioinformatics and computational biology › systems biology
parameter estimation
0.612022
Topological approximate Bayesian computation for parameter inference of an angiogenesis model · Bioinform. 2022

Methods — techniques the papers use, named apart from their topics

optimization · 1.7nerve construction · 1.7mapper · 1.7topological data analysis · 1.6approximate bayesian computation · 1.6
YearPublicationVenuePosition
2026 Topological model selection: a case-study in tumour-induced angiogenesis
abstract
MOTIVATION: Comparing mathematical models offers a means to evaluate competing scientific theories. However, exact methods of model calibration are not applicable to many probabilistic models which simulate high-dimensional spatio-temporal data. Approximate Bayesian Computation is a widely used method for parameter inference and model selection in such scenarios, and it may be combined with Topological Data Analysis to study models which simulate data with fine spatial structure. RESULTS: We develop a flexible pipeline for parameter inference and model selection in spatio-temporal models. Our pipeline identifies topological summary statistics which quantify spatio-temporal data and uses them to approximate parameter and model posterior distributions. We validate our pipeline on models of tumour-induced angiogenesis, inferring four parameters in three established models and identifying the correct model in synthetic test-cases. AVAILABILITY AND IMPLEMENTATION: Simulation code for all models, data analyses, parameter inference and model selection is available online at https://github.com/rmcdomaths/tms/ and archived at https://doi.org/10.5281/zenodo.17392787.
Robert A. McDonald, Helen M. Byrne, Heather A. Harrington, Thomas Thorne, Bernadette J. Stolz
Bioinform.3
2025 Cover learning for large-scale topology representation
abstract
Classical unsupervised learning methods like clustering and linear dimensionality reduction parametrize large-scale geometry when it is discrete or linear, while more modern methods from manifold learning find low dimensional representation or infer local geometry by constructing a graph on the input data. More recently, topological data analysis popularized the use of simplicial complexes to represent data topology with two main methodologies: topological inference with geometric complexes and large-scale topology representation with Mapper graphs -- central to these is the nerve construction from topology, which builds a simplicial complex given any cover of a space by subsets. While successful, these have limitations: geometric complexes scale poorly with data size, and Mapper graphs can be hard to tune and only contain low dimensional information. In this paper, we propose to study the problem of learning covers in its own right, and from the perspective of optimization. We describe a method to learn topologically-faithful covers of geometric datasets, and show that the simplicial complexes thus obtained can outperform standard topological inference approaches in terms of size, and Mapper-type algorithms in terms of representation of large-scale topology.
Luis Scoccola, Uzu Lim, Heather A. Harrington
ICML3
2025 Absolute concentration robustness: Algebra and geometry
Luis David García-Puente, Elizabeth Gross, Heather A. Harrington, Matthew D. Johnston, Nicolette Meshkat, Mercedes Pérez Millán, Anne Shiu
J. Symb. Comput.3
2025 Topology across scales on heterogeneous cell data
abstract
Multiplexed imaging allows multiple cell types to be simultaneously visualised in a single tissue sample, generating unprecedented amounts of spatially-resolved, biological data. In topological data analysis, persistent homology provides multiscale descriptors of "shape" suitable for the analysis of such spatial data. Here we propose a novel visualisation of persistent homology (PH) and fine-tune vectorisations thereof (exploring the effect of different weightings for persistence images, a prominent vectorisation of PH). These approaches offer new biological interpretations and promising avenues for improving the analysis of complex spatial biological data especially in multiple cell type data. To illustrate our methods, we apply them to a lung data set from fatal cases of COVID-19 and a data set from lupus murine spleen.
Maria Torras-Pérez, Iris Yoon, Praveen Weeratunga, Ling-Pei Ho, Helen M. Byrne, Ulrike Tillmann, Heather A. Harrington
PLoS Comput. Biol.7
2022 Topological approximate Bayesian computation for parameter inference of an angiogenesis model
abstract
MOTIVATION: Inferring the parameters of models describing biological systems is an important problem in the reverse engineering of the mechanisms underlying these systems. Much work has focused on parameter inference of stochastic and ordinary differential equation models using Approximate Bayesian Computation (ABC). While there is some recent work on inference in spatial models, this remains an open problem. Simultaneously, advances in topological data analysis (TDA), a field of computational mathematics, have enabled spatial patterns in data to be characterized. RESULTS: Here, we focus on recent work using TDA to study different regimes of parameter space for a well-studied model of angiogenesis. We propose a method for combining TDA with ABC to infer parameters in the Anderson-Chaplain model of angiogenesis. We demonstrate that this topological approach outperforms ABC approaches that use simpler statistics based on spatial features of the data. This is a first step toward a general framework of spatial parameter inference for biological systems, for which there may be a variety of filtrations, vectorizations and summary statistics to be considered. AVAILABILITY AND IMPLEMENTATION: All code used to produce our results is available as a Snakemake workflow from github.com/tt104/tabc_angio.
Thomas Thorne, Paul D. W. Kirk, Heather A. Harrington
Bioinform.3
2021 Topological data analysis distinguishes parameter regimes in the Anderson-Chaplain model of angiogenesis
abstract
Angiogenesis is the process by which blood vessels form from pre-existing vessels. It plays a key role in many biological processes, including embryonic development and wound healing, and contributes to many diseases including cancer and rheumatoid arthritis. The structure of the resulting vessel networks determines their ability to deliver nutrients and remove waste products from biological tissues. Here we simulate the Anderson-Chaplain model of angiogenesis at different parameter values and quantify the vessel architectures of the resulting synthetic data. Specifically, we propose a topological data analysis (TDA) pipeline for systematic analysis of the model. TDA is a vibrant and relatively new field of computational mathematics for studying the shape of data. We compute topological and standard descriptors of model simulations generated by different parameter values. We show that TDA of model simulation data stratifies parameter space into regions with similar vessel morphology. The methodologies proposed here are widely applicable to other synthetic and experimental data including wound healing, development, and plant biology.
John T. Nardini, Bernadette J. Stolz, Kevin B. Flores, Heather A. Harrington, Helen M. Byrne
PLoS Comput. Biol.4
2019 Sampling Real Algebraic Varieties for Topological Data Analysis
abstract
Topological data analysis (TDA) provides tools for computing geometric and topological information about spaces from a finite sample of points. We present an adaptive algorithm for finding provably dense samples of points on real algebraic varieties given a set of defining polynomials for use as input to TDA. The algorithm utilizes methods from numerical algebraic geometry to give formal guarantees about the density of the sampling, and also employs geometric heuristics to reduce the size of the sample. As TDA methods consume significant computational resources that scale poorly in the number of sample points, our sampling minimization makes applying TDA methods more feasible. We provide a software package that implements the algorithm, and showcase it through several examples.
Emilie Dufresne, Parker B. Edwards, Heather A. Harrington, Jonathan D. Hauenstein
ICMLA3
2017 The role of the Hes1 crosstalk hub in Notch-Wnt interactions of the intestinal crypt
abstract
The Notch pathway plays a vital role in determining whether cells in the intestinal epithelium adopt a secretory or an absorptive phenotype. Cell fate specification is coordinated via Notch's interaction with the canonical Wnt pathway. Here, we propose a new mathematical model of the Notch and Wnt pathways, in which the Hes1 promoter acts as a hub for pathway crosstalk. Computational simulations of the model can assist in understanding how healthy intestinal tissue is maintained, and predict the likely consequences of biochemical knockouts upon cell fate selection processes. Chemical reaction network theory (CRNT) is a powerful, generalised framework which assesses the capacity of our model for monostability or multistability, by analysing properties of the underlying network structure without recourse to specific parameter values or functional forms for reaction rates. CRNT highlights the role of β-catenin in stabilising the Notch pathway and damping oscillations, demonstrating that Wnt-mediated actions on the Hes1 promoter can induce dynamic transitions in the Notch system, from multistability to monostability. Time-dependent model simulations of cell pairs reveal the stabilising influence of Wnt upon the Notch pathway, in which β-catenin- and Dsh-mediated action on the Hes1 promoter are key in shaping the subcellular dynamics. Where Notch-mediated transcription of Hes1 dominates, there is Notch oscillation and maintenance of fate flexibility; Wnt-mediated transcription of Hes1 favours bistability akin to cell fate selection. Cells could therefore regulate the proportion of Wnt- and Notch-mediated control of the Hes1 promoter to coordinate the timing of cell fate selection as they migrate through the intestinal epithelium and are subject to reduced Wnt stimuli. Furthermore, mutant cells characterised by hyperstimulation of the Wnt pathway may, through coupling with Notch, invert cell fate in neighbouring healthy cells, enabling an aberrant cell to maintain its neighbours in mitotically active states.
Sophie K. Kay, Heather A. Harrington, Sarah Shepherd, Keith Brennan, Trevor Dale, James M. Osborne, David Gavaghan, Helen M. Byrne
PLoS Comput. Biol.2
2010 Bistability in Apoptosis by Receptor Clustering
abstract
Apoptosis is a highly regulated cell death mechanism involved in many physiological processes. A key component of extrinsically activated apoptosis is the death receptor Fas which, on binding to its cognate ligand FasL, oligomerize to form the death-inducing signaling complex. Motivated by recent experimental data, we propose a mathematical model of death ligand-receptor dynamics where FasL acts as a clustering agent for Fas, which form locally stable signaling platforms through proximity-induced receptor interactions. Significantly, the model exhibits hysteresis, providing an upstream mechanism for bistability and robustness. At low receptor concentrations, the bistability is contingent on the trimerism of FasL. Moreover, irreversible bistability, representing a committed cell death decision, emerges at high concentrations which may be achieved through receptor pre-association or localization onto membrane lipid rafts. Thus, our model provides a novel theory for these observed biological phenomena within the unified context of bistability. Importantly, as Fas interactions initiate the extrinsic apoptotic pathway, our model also suggests a mechanism by which cells may function as bistable life/death switches independently of any such dynamics in their downstream components. Our results highlight the role of death receptors in deciding cell fate and add to the signal processing capabilities attributed to receptor clustering.
Kenneth L. Ho, Heather A. Harrington
PLoS Comput. Biol.2