2 citations · 3 across the 5 of their papers we have counts for
5 papers
The Pfaffian Structure of CFN Phylogenetic Networks
Joseph Cummings, Elizabeth Gross, Benjamin Hollering +2
Algebraic techniques in phylogenetics have historically been successful at proving identifiability results and have also led to novel reconstruction algorithms. In this paper, we s…
Computing Implicitizations of Multi-Graded Polynomial Maps
Joseph Cummings, Benjamin Hollering
In this paper, we focus on computing the kernel of a map of polynomial rings . This core problem in symbolic computation is known as implicitization. While there are extremely e…
Identifiability of the Rooted Tree Parameter under the Cavender-Farris-Neyman Model with a Molecular Clock
Jane Ivy Coons, Benjamin Hollering
Identifiability of the discrete tree parameter is a key property for phylogenetic models since it is necessary for statistically consistent estimation of the tree from sequence dat…
Invariants for level-1 phylogenetic networks under the Cavendar-Farris-Neyman Model
Joseph Cummings, Benjamin Hollering, Christopher Manon
Phylogenetic networks can model more complicated evolutionary phenomena that trees fail to capture such as horizontal gene transfer and hybridization. The same Markov models that a…
Generalized Cut Polytopes for Binary Hierarchical Models
Jane Ivy Coons, Joseph Cummings, Benjamin Hollering +1
Marginal polytopes are important geometric objects that arise in statistics as the polytopes underlying hierarchical log-linear models. These polytopes can be used to answer geomet…