Zobrazeno 1 - 10
of 1 141
pro vyhledávání: '"Francis, Andrew"'
Finding a minimal factorization for a generic semigroup can be done by using the Froidure-Pin Algorithm, which is not feasible for semigroups of large sizes. On the other hand, if we restrict our attention to just a particular semigroup, we could lev
Externí odkaz:
http://arxiv.org/abs/2402.07874
Publikováno v:
J. Math. Biol. 88, 58 (2024)
It was recently shown that a large class of phylogenetic networks, the `labellable' networks, is in bijection with the set of `expanding' covers of finite sets. In this paper, we show how several prominent classes of phylogenetic networks can be char
Externí odkaz:
http://arxiv.org/abs/2306.06519