2 citations · 3 across the 5 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
math.AG2023
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…
math.AG2023
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…
q-bio.PE2023
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…