Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Michael Hendriksen"'
Autor:
Josip Skejo, Matthew Connors, Michael Hendriksen, Nick Lambert, Griffin Chong, Ian McMaster, Nick Monaghan, David Rentz, Reiner Richter, Kathy Rose, Damjan Franjević
Publikováno v:
ZooKeys, Vol 948, Iss , Pp 107-119 (2020)
Knowledge on the pygmy grasshoppers of Australia is, despite the numerous endemics being described from this unique continent, still scarce. Of interest is the Vingselina genus group, including genera Anaselina Storozhenko, 2019, Paraselina Storozhen
Externí odkaz:
https://doaj.org/article/97d4d1c28c14401b817ad46a2ae0ffe0
Publikováno v:
PLoS ONE, Vol 17, Iss 5, p e0268181 (2022)
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:
https://doaj.org/article/81a0e1f69dcf4607ab349bf0ec10a0d6
Autor:
Michael Hendriksen, Andrew R. Francis
Publikováno v:
Journal of Mathematical Biology. 80:1265-1290
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2c9b97ee4b284f531a22db8612bd689e
https://doi.org/10.1007/s00285-019-01461-1
https://doi.org/10.1007/s00285-019-01461-1
Autor:
Nils Kapust, Michael Hendriksen
Publikováno v:
Bulletin of Mathematical Biology
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::be95a334806e835317ff94717f66f57d
https://doi.org/10.1007/s11538-021-00911-6
https://doi.org/10.1007/s11538-021-00911-6
Autor:
Damjan Franjević, Sriram G. Garg, Fernando D. K. Tria, William Martin, Sven B. Gould, Neil W. Blackstone, Michael Hendriksen, Josip Skejo, Nico Bremer
Publikováno v:
Genome Biology and Evolution
Modern accounts of eukaryogenesis entail an endosymbiotic encounter between an archaeal host and a proteobacterial endosymbiont, with subsequent evolution giving rise to a unicell possessing a single nucleus and mitochondria. The mononucleate state o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::11a39cd27a3259cd7915b4f41347cd29
https://doi.org/10.1093/gbe/evab096
https://doi.org/10.1093/gbe/evab096
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::79ce292ff2d537f064aae58558f7194e
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1edeae66577c609f37e531fd8cbcbc76
Autor:
Julia A. Shore, Michael Hendriksen
Publikováno v:
Bulletin of Mathematical Biology
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::97c773ab4238445fcee15767bc4c2ad9
Autor:
Michael Hendriksen, Andrew R. Francis
Publikováno v:
Mathematical biosciences. 318
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::427a5b422b19e7cc3da7d8810f2bcffc
https://pubmed.ncbi.nlm.nih.gov/31711966
https://pubmed.ncbi.nlm.nih.gov/31711966
Autor:
David Easdown, Michael Hendriksen
Publikováno v:
Journal of Group Theory. 19:1017-1048
We provide formulae for the minimal faithful permutation degree μ ( G ) ${\mu(G)}$ of a group G that is a semidirect product of an elementary abelian p-group by a group of prime order q not equal to p. These formulae apply to the investigation o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::75820d099bbab75b9e973b3e932a8e78
https://doi.org/10.1515/jgth-2016-0015
https://doi.org/10.1515/jgth-2016-0015