Matthew James Penn
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Matthew James Penn has a total of 54 co-authors. Here are the top co-authors by number of shared publications:
Christl A. Donnelly
Department of Statistics, University of Oxford, Oxford, UK
6 shared publications- Christl Ann Donnelly
Department of Statistics, University of Oxford, Oxford, United Kingdom
6 shared publications - Samir Bhatt
Section for Health Data Science and AI, Department of Public Health, University of Copenhagen, Copenhagen, Denmark
6 shared publications - David Alejandro Duchêne
Department of Public Health, University of Copenhagen, Copenhagen, Denmark
5 shared publications Neil Scheidwasser
Section of Epidemiology, University of Copenhagen, Copenhagen, Denmark
4 shared publicationsSamir Bhatt
University of Copenhagen 3
4 shared publications
Latest Publications
- Open Access
- 27 May 2026
- Published by The Royal Society in Royal Society Open Science
- Vol. 13 (5)
Dynamic graph-based forecasts of bookmakers’ odds in professional tennis
Bookmakers’ odds consistently provide one of the most accurate methods for predicting the results of professional tennis matches. However, these odds usually only become available shortly before a match takes place, limiting their usefulness as an analysis tool. To ameliorate this issue, we introduce a novel dynamic graph-based model which aims to forecast bookmakers’ odds for any match on any surface, allowing effective and detailed pre-tournament predictions to be made. By leveraging the high-quality information embedded in these odds, our model incorporates the most up-to-date market assessments of player ability. By analysing major tennis championships from 2024 and 2025, we show that our model achieves comparable accuracy to the bookmakers while significantly outperforming benchmark models on a range of metrics.
- 27 May 2026
- Published by The Royal Society in Royal Society Open Science
- Vol. 13 (5)
Open AccessDynamic graph-based forecasts of bookmakers’ odds in professional tennis
Bookmakers’ odds consistently provide one of the most accurate methods for predicting the results of professional tennis matches. However, these odds usually only become available shortly before a match takes place, limiting their usefulness as an analysis tool. To ameliorate this issue, we introduce a novel dynamic graph-based model which aims to forecast bookmakers’ odds for any match on any surface, allowing effective and detailed pre-tournament predictions to be made. By leveraging the high-quality information embedded in these odds, our model incorporates the most up-to-date market assessments of player ability. By analysing major tennis championships from 2024 and 2025, we show that our model achieves comparable accuracy to the bookmakers while significantly outperforming benchmark models on a range of metrics.
- Open Access
- 28 October 2025
- Published by The Open Journal in Journal of Open Source Software
- Vol. 10 (114) , 9040
phylo2vec: a library for vector-based phylogenetic tree manipulation
Compared to the traditional Newick format which represents trees using strings of nested parentheses (Felsenstein, 2004), modern tree representations utilise integer vectors to define the tree topology traversal. This approach offers several advantages, including easier manipulation, increased memory efficiency, and applicability to machine learning.
- 28 October 2025
- Published by The Open Journal in Journal of Open Source Software
- Vol. 10 (114) , 9040
Open Accessphylo2vec: a library for vector-based phylogenetic tree manipulation
Compared to the traditional Newick format which represents trees using strings of nested parentheses (Felsenstein, 2004), modern tree representations utilise integer vectors to define the tree topology traversal. This approach offers several advantages, including easier manipulation, increased memory efficiency, and applicability to machine learning.
- Open Access
- 22 October 2025
- Published by The Royal Society in Royal Society Open Science
- Vol. 12 (10) , 251175
Continuous football player tracking from discrete broadcast data
Player tracking data remain out of reach for many professional football teams, as their video feeds are not sufficiently high quality for computer vision technologies to be used. To help bridge this gap, we present a method that can estimate continuous full-pitch tracking data from discrete data made from broadcast footage. Such data could be collected by clubs or players at a similar cost to event data, which are widely available down to the semi-professional level. We test our method using open-source tracking data and include a version that can be applied to a large set of over 200 games with such discrete data.
- 22 October 2025
- Published by The Royal Society in Royal Society Open Science
- Vol. 12 (10) , 251175
Open AccessContinuous football player tracking from discrete broadcast data
Player tracking data remain out of reach for many professional football teams, as their video feeds are not sufficiently high quality for computer vision technologies to be used. To help bridge this gap, we present a method that can estimate continuous full-pitch tracking data from discrete data made from broadcast footage. Such data could be collected by clubs or players at a similar cost to event data, which are widely available down to the semi-professional level. We test our method using open-source tracking data and include a version that can be applied to a large set of over 200 games with such discrete data.
- Open Access
- 23 January 2025
- Published by Springer Nature in Bulletin of Mathematical Biology
- Vol. 87 (2) , 1-21
Bayesian Inference of Phylogenetic Distances: Revisiting the Eigenvalue Approach
Using genetic data to infer evolutionary distances between molecular sequence pairs based on a Markov substitution model is a common procedure in phylogenetics, in particular for selecting a good starting tree to improve upon. Many evolutionary patterns can be accurately modelled using substitution models that are available in closed form, including the popular general time reversible model (GTR) for DNA data. For more complex biological phenomena, such as variations in lineage-specific evolutionary rates over time (heterotachy), other approaches such as the GTR with rate variation (GTR $$+\Gamma $$ ) are required, but do not admit analytical solutions and do not automatically allow for likelihood calculations crucial for Bayesian analysis. In this paper, we derive a hybrid approach between these two methods, incorporating $$\Gamma (\alpha ,\alpha )$$ -distributed rate variation and heterotachy into a hierarchical Bayesian GTR-style framework. Our approach is differentiable and amenable to both stochastic gradient descent for optimisation and Hamiltonian Markov chain Monte Carlo for Bayesian inference. We show the utility of our approach by studying hypotheses regarding the origins of the eukaryotic cell within the context of a universal tree of life and find evidence for a two-domain theory.- 23 January 2025
- Published by Springer Nature in Bulletin of Mathematical Biology
- Vol. 87 (2) , 1-21
Open AccessBayesian Inference of Phylogenetic Distances: Revisiting the Eigenvalue Approach
Using genetic data to infer evolutionary distances between molecular sequence pairs based on a Markov substitution model is a common procedure in phylogenetics, in particular for selecting a good starting tree to improve upon. Many evolutionary patterns can be accurately modelled using substitution models that are available in closed form, including the popular general time reversible model (GTR) for DNA data. For more complex biological phenomena, such as variations in lineage-specific evolutionary rates over time (heterotachy), other approaches such as the GTR with rate variation (GTR $$+\Gamma $$ ) are required, but do not admit analytical solutions and do not automatically allow for likelihood calculations crucial for Bayesian analysis. In this paper, we derive a hybrid approach between these two methods, incorporating $$\Gamma (\alpha ,\alpha )$$ -distributed rate variation and heterotachy into a hierarchical Bayesian GTR-style framework. Our approach is differentiable and amenable to both stochastic gradient descent for optimisation and Hamiltonian Markov chain Monte Carlo for Bayesian inference. We show the utility of our approach by studying hypotheses regarding the origins of the eukaryotic cell within the context of a universal tree of life and find evidence for a two-domain theory. - Open Access
- 27 June 2024
- Published by Oxford University Press (OUP) in Systematic Biology
- Vol. 74 (2) , 250-266
Phylo2Vec: A Vector Representation for Binary Trees
Binary phylogenetic trees inferred from biological data are central to understanding the shared history among evolutionary units. However, inferring the placement of latent nodes in a tree is computationally expensive. State-of-the-art methods rely on carefully designed heuristics for tree search, using different data structures for easy manipulation (e.g., classes in object-oriented programming languages) and readable representation of trees (e.g., Newick-format strings). Here, we present Phylo2Vec, a parsimonious encoding for phylogenetic trees that serves as a unified approach for both manipulating and representing phylogenetic trees. Phylo2Vec maps any binary tree with n leaves to a unique integer vector of length n − 1. The advantages of Phylo2Vec are fourfold: i) fast tree sampling, (ii) compressed tree representation compared to a Newick string, iii) quick and unambiguous verification if two binary trees are identical topologically, and iv) systematic ability to traverse tree space in very large or small jumps. As a proof of concept, we use Phylo2Vec for maximum likelihood inference on five real-world datasets and show that a simple hill-climbing-based optimisation scheme can efficiently traverse the vastness of tree space from a random to an optimal tree.
- 27 June 2024
- Published by Oxford University Press (OUP) in Systematic Biology
- Vol. 74 (2) , 250-266
Open AccessPhylo2Vec: A Vector Representation for Binary Trees
Binary phylogenetic trees inferred from biological data are central to understanding the shared history among evolutionary units. However, inferring the placement of latent nodes in a tree is computationally expensive. State-of-the-art methods rely on carefully designed heuristics for tree search, using different data structures for easy manipulation (e.g., classes in object-oriented programming languages) and readable representation of trees (e.g., Newick-format strings). Here, we present Phylo2Vec, a parsimonious encoding for phylogenetic trees that serves as a unified approach for both manipulating and representing phylogenetic trees. Phylo2Vec maps any binary tree with n leaves to a unique integer vector of length n − 1. The advantages of Phylo2Vec are fourfold: i) fast tree sampling, (ii) compressed tree representation compared to a Newick string, iii) quick and unambiguous verification if two binary trees are identical topologically, and iv) systematic ability to traverse tree space in very large or small jumps. As a proof of concept, we use Phylo2Vec for maximum likelihood inference on five real-world datasets and show that a simple hill-climbing-based optimisation scheme can efficiently traverse the vastness of tree space from a random to an optimal tree.
- Open Access
Bayesian inference of phylogenetic distances: revisiting the eigenvalue approach
Using genetic data to infer evolutionary distances between molecular sequence pairs based on a Markov substitution model is a common procedure in phylogenetics, in particular for selecting a good starting tree to improve upon. Many evolutionary patterns can be accurately modelled using substitution models that are available in closed form, including the popular general time reversible model (GTR) for DNA data. For more unusual biological phenomena such as variations in lineage-specific evolutionary rates over time (heterotachy), more complex approaches uch as the GTR with rate variation (GTR +G ) are required, but do not admit analytical solutions and do not automatically allow for likelihood calculations crucial for Bayesian analysis. In this paper, we derive a hybrid approach between these two methods, incorporating G( α, α ) -distributed rate variation and heterotachy into a hierarchical Bayesian GTR-style framework. Our approach is differentiable and amenable to both stochastic gradient descent for optimisation and Hamiltonian Markov chain Monte Carlo for Bayesian inference. We show the utility of our approach by studying hypotheses regarding the origins of the eukaryotic cell within the context of a universal tree of life and find evidence for a two-domain theory.
Open AccessBayesian inference of phylogenetic distances: revisiting the eigenvalue approach
Using genetic data to infer evolutionary distances between molecular sequence pairs based on a Markov substitution model is a common procedure in phylogenetics, in particular for selecting a good starting tree to improve upon. Many evolutionary patterns can be accurately modelled using substitution models that are available in closed form, including the popular general time reversible model (GTR) for DNA data. For more unusual biological phenomena such as variations in lineage-specific evolutionary rates over time (heterotachy), more complex approaches uch as the GTR with rate variation (GTR +G ) are required, but do not admit analytical solutions and do not automatically allow for likelihood calculations crucial for Bayesian analysis. In this paper, we derive a hybrid approach between these two methods, incorporating G( α, α ) -distributed rate variation and heterotachy into a hierarchical Bayesian GTR-style framework. Our approach is differentiable and amenable to both stochastic gradient descent for optimisation and Hamiltonian Markov chain Monte Carlo for Bayesian inference. We show the utility of our approach by studying hypotheses regarding the origins of the eukaryotic cell within the context of a universal tree of life and find evidence for a two-domain theory.
- Open Access
- 28 December 2023
- Published by Oxford University Press (OUP) in Systematic Biology
- Vol. 73 (1) , 235-246
The Limits of the Constant-rate Birth–Death Prior for Phylogenetic Tree Topology Inference
Birth–death models are stochastic processes describing speciation and extinction through time and across taxa and are widely used in biology for inference of evolutionary timescales. Previous research has highlighted how the expected trees under the constant-rate birth–death (crBD) model tend to differ from empirical trees, for example, with respect to the amount of phylogenetic imbalance. However, our understanding of how trees differ between the crBD model and the signal in empirical data remains incomplete. In this Point of View, we aim to expose the degree to which the crBD model differs from empirically inferred phylogenies and test the limits of the model in practice. Using a wide range of topology indices to compare crBD expectations against a comprehensive dataset of 1189 empirically estimated trees, we confirm that crBD model trees frequently differ topologically compared with empirical trees. To place this in the context of standard practice in the field, we conducted a meta-analysis for a subset of the empirical studies. When comparing studies that used Bayesian methods and crBD priors with those that used other non-crBD priors and non-Bayesian methods (i.e., maximum likelihood methods), we do not find any significant differences in tree topology inferences. To scrutinize this finding for the case of highly imbalanced trees, we selected the 100 trees with the greatest imbalance from our dataset, simulated sequence data for these tree topologies under various evolutionary rates, and re-inferred the trees under maximum likelihood and using the crBD model in a Bayesian setting. We find that when the substitution rate is low, the crBD prior results in overly balanced trees, but the tendency is negligible when substitution rates are sufficiently high. Overall, our findings demonstrate the general robustness of crBD priors across a broad range of phylogenetic inference scenarios but also highlight that empirically observed phylogenetic imbalance is highly improbable under the crBD model, leading to systematic bias in data sets with limited information content.
- 28 December 2023
- Published by Oxford University Press (OUP) in Systematic Biology
- Vol. 73 (1) , 235-246
Open AccessThe Limits of the Constant-rate Birth–Death Prior for Phylogenetic Tree Topology Inference
Birth–death models are stochastic processes describing speciation and extinction through time and across taxa and are widely used in biology for inference of evolutionary timescales. Previous research has highlighted how the expected trees under the constant-rate birth–death (crBD) model tend to differ from empirical trees, for example, with respect to the amount of phylogenetic imbalance. However, our understanding of how trees differ between the crBD model and the signal in empirical data remains incomplete. In this Point of View, we aim to expose the degree to which the crBD model differs from empirically inferred phylogenies and test the limits of the model in practice. Using a wide range of topology indices to compare crBD expectations against a comprehensive dataset of 1189 empirically estimated trees, we confirm that crBD model trees frequently differ topologically compared with empirical trees. To place this in the context of standard practice in the field, we conducted a meta-analysis for a subset of the empirical studies. When comparing studies that used Bayesian methods and crBD priors with those that used other non-crBD priors and non-Bayesian methods (i.e., maximum likelihood methods), we do not find any significant differences in tree topology inferences. To scrutinize this finding for the case of highly imbalanced trees, we selected the 100 trees with the greatest imbalance from our dataset, simulated sequence data for these tree topologies under various evolutionary rates, and re-inferred the trees under maximum likelihood and using the crBD model in a Bayesian setting. We find that when the substitution rate is low, the crBD prior results in overly balanced trees, but the tendency is negligible when substitution rates are sufficiently high. Overall, our findings demonstrate the general robustness of crBD priors across a broad range of phylogenetic inference scenarios but also highlight that empirically observed phylogenetic imbalance is highly improbable under the crBD model, leading to systematic bias in data sets with limited information content.
- Open Access
- 1 December 2023
- Published by Oxford University Press (OUP) in Genome Biology and Evolution
- Vol. 15 (12)
Leaping through Tree Space: Continuous Phylogenetic Inference for Rooted and Unrooted Trees
Phylogenetics is now fundamental in life sciences, providing insights into the earliest branches of life and the origins and spread of epidemics. However, finding suitable phylogenies from the vast space of possible trees remains challenging. To address this problem, for the first time, we perform both tree exploration and inference in a continuous space where the computation of gradients is possible. This continuous relaxation allows for major leaps across tree space in both rooted and unrooted trees, and is less susceptible to convergence to local minima. Our approach outperforms the current best methods for inference on unrooted trees and, in simulation, accurately infers the tree and root in ultrametric cases. The approach is effective in cases of empirical data with negligible amounts of data, which we demonstrate on the phylogeny of jawed vertebrates. Indeed, only a few genes with an ultrametric signal were generally sufficient for resolving the major lineages of vertebrates. Optimization is possible via automatic differentiation and our method presents an effective way forward for exploring the most difficult, data-deficient phylogenetic questions.
- 1 December 2023
- Published by Oxford University Press (OUP) in Genome Biology and Evolution
- Vol. 15 (12)
Open AccessLeaping through Tree Space: Continuous Phylogenetic Inference for Rooted and Unrooted Trees
Phylogenetics is now fundamental in life sciences, providing insights into the earliest branches of life and the origins and spread of epidemics. However, finding suitable phylogenies from the vast space of possible trees remains challenging. To address this problem, for the first time, we perform both tree exploration and inference in a continuous space where the computation of gradients is possible. This continuous relaxation allows for major leaps across tree space in both rooted and unrooted trees, and is less susceptible to convergence to local minima. Our approach outperforms the current best methods for inference on unrooted trees and, in simulation, accurately infers the tree and root in ultrametric cases. The approach is effective in cases of empirical data with negligible amounts of data, which we demonstrate on the phylogeny of jawed vertebrates. Indeed, only a few genes with an ultrametric signal were generally sufficient for resolving the major lineages of vertebrates. Optimization is possible via automatic differentiation and our method presents an effective way forward for exploring the most difficult, data-deficient phylogenetic questions.
- 1 December 2023
- Published by Oxford University Press (OUP) in Significance
- Vol. 20 (6) , 22-25
Barely a passing resemblance: Why women's football stands out from the crowd
Many of us find women's football more exciting to watch than the men's game. But why? A statistical analysis by Matthew J. Penn and Joanna Marks provides some answers
- 1 December 2023
- Published by Oxford University Press (OUP) in Significance
- Vol. 20 (6) , 22-25
Barely a passing resemblance: Why women's football stands out from the crowd
Many of us find women's football more exciting to watch than the men's game. But why? A statistical analysis by Matthew J. Penn and Joanna Marks provides some answers
- Open Access
- 27 November 2023
- Published by Wiley in Methods in Ecology and Evolution
- Vol. 15 (1) , 91-102
Sherlock—A flexible, low‐resource tool for processing camera‐trapping images
The use of camera traps to study wildlife has increased markedly in the last two decades. Camera surveys typically produce large data sets which require processing to isolate images containing the species of interest. This is time consuming and costly, particularly if there are many empty images that can result from false triggers. Computer vision technology can assist with data processing, but existing artificial intelligence algorithms are limited by the requirement of a training data set, which itself can be challenging to acquire. Furthermore, deep‐learning methods often require powerful hardware and proficient coding skills. We present Sherlock, a novel algorithm that can reduce the time required to process camera trap data by removing a large number of unwanted images. The code is adaptable, simple to use and requires minimal processing power. We tested Sherlock on 240,596 camera trap images collected from 46 cameras placed in a range of habitats on farms in Cornwall, United Kingdom, and set the parameters to find European badgers (Meles meles). The algorithm correctly classified 91.9% of badger images and removed 49.3% of the unwanted ‘empty’ images. When testing model parameters, we found that faster processing times were achieved by reducing both the number of sampled pixels and ‘bouncing’ attempts (the number of paths explored to identify a disturbance), with minimal implications for model sensitivity and specificity. When Sherlock was tested on two sites which contained no livestock in their images, its performance greatly improved and it removed 92.3% of the empty images. Although further refinements may improve its performance, Sherlock is currently an accessible, simple and useful tool for processing camera trap data.
- 27 November 2023
- Published by Wiley in Methods in Ecology and Evolution
- Vol. 15 (1) , 91-102
Open AccessSherlock—A flexible, low‐resource tool for processing camera‐trapping images
The use of camera traps to study wildlife has increased markedly in the last two decades. Camera surveys typically produce large data sets which require processing to isolate images containing the species of interest. This is time consuming and costly, particularly if there are many empty images that can result from false triggers. Computer vision technology can assist with data processing, but existing artificial intelligence algorithms are limited by the requirement of a training data set, which itself can be challenging to acquire. Furthermore, deep‐learning methods often require powerful hardware and proficient coding skills. We present Sherlock, a novel algorithm that can reduce the time required to process camera trap data by removing a large number of unwanted images. The code is adaptable, simple to use and requires minimal processing power. We tested Sherlock on 240,596 camera trap images collected from 46 cameras placed in a range of habitats on farms in Cornwall, United Kingdom, and set the parameters to find European badgers (Meles meles). The algorithm correctly classified 91.9% of badger images and removed 49.3% of the unwanted ‘empty’ images. When testing model parameters, we found that faster processing times were achieved by reducing both the number of sampled pixels and ‘bouncing’ attempts (the number of paths explored to identify a disturbance), with minimal implications for model sensitivity and specificity. When Sherlock was tested on two sites which contained no livestock in their images, its performance greatly improved and it removed 92.3% of the empty images. Although further refinements may improve its performance, Sherlock is currently an accessible, simple and useful tool for processing camera trap data.