Zobrazeno 1 - 10
of 60
pro vyhledávání: '"Hendriksen, Michael"'
Invariants for complicated objects such as those arising in phylogenetics, whether they are invariants as matrices, polynomials, or other mathematical structures, are important tools for distinguishing and working with such objects. In this paper, we
Externí odkaz:
http://arxiv.org/abs/2112.15179
We consider the problem of enumerating integer tetrahedra of fixed perimeter (sum of side-lengths) and/or diameter (maximum side-length), up to congruence. As we will see, this problem is considerably more difficult than the corresponding problem for
Externí odkaz:
http://arxiv.org/abs/2112.00899
Publikováno v:
In Computational Geometry: Theory and Applications August 2024 121
Autor:
Fischer, Mareike, Hendriksen, Michael
In a recent study, Bryant, Francis and Steel investigated the concept of \enquote{future-proofing} consensus methods in phylogenetics. That is, they investigated if such methods can be robust against the introduction of additional data like added tre
Externí odkaz:
http://arxiv.org/abs/2102.04502
Autor:
Hendriksen, Michael, Shore, Julia A.
In phylogenetics it is of interest for rate matrix sets to satisfy closure under matrix multiplication as this makes finding the set of corresponding transition matrices possible without having to compute matrix exponentials. It is also advantageous
Externí odkaz:
http://arxiv.org/abs/2009.11599
Autor:
Hendriksen, Michael, Kapust, Nils
The concept of $k$-compatibility measures how many phylogenetic trees it would take to display all splits in a given set. A set of trees that display every single possible split is termed a \textit{universal tree set}. In this note, we find $A(n)$, t
Externí odkaz:
http://arxiv.org/abs/2004.00062
Autor:
Hendriksen, Michael, Francis, Andrew
Phylogenetic trees are often constructed by using a metric on the set of taxa that label the leaves of the tree. While there are a number of methods for constructing a tree using a given metric, such trees will only display the metric if it satisfies
Externí odkaz:
http://arxiv.org/abs/1908.08647
Autor:
Hendriksen, Michael, Francis, Andrew
Metrics on rooted phylogenetic trees are integral to a number of areas of phylogenetic analysis. Cluster-similarity metrics have recently been introduced in order to limit skew in the distribution of distances, and to ensure that trees in the neighbo
Externí odkaz:
http://arxiv.org/abs/1906.02411
Publikováno v:
In Computational Geometry: Theory and Applications January 2023 108
Autor:
Hendriksen, Michael, Francis, Andrew
There is a long tradition of the axiomatic study of consensus methods in phylogenetics that satisfy certain desirable properties. One recently-introduced property is associative stability, which is desirable because it confers a computational advanta
Externí odkaz:
http://arxiv.org/abs/1810.06831