[图书][B] Phylogeny: discrete and random processes in evolution

M Steel - 2016 - SIAM
The idea that all life on earth traces back to a common origin dates back at least to Charles
Darwin's Origin of Species. Ever since, biologists have tried to piece together parts of this …

Position and content paradigms in genome rearrangements: the wild and crazy world of permutations in genomics

S Bhatia, P Feijão, AR Francis - Bulletin of Mathematical Biology, 2018 - Springer
Modellers of large-scale genome rearrangement events, in which segments of DNA are
inverted, moved, swapped, or even inserted or deleted, have found a natural syntax in the …

A symmetry-inclusive algebraic approach to genome rearrangement

V Terauds, J Stevenson, J Sumner - Journal of Bioinformatics and …, 2021 - World Scientific
Of the many modern approaches to calculating evolutionary distance via models of genome
rearrangement, most are tied to a particular set of genomic modeling assumptions and to a …

The complexity of genome rearrangement combinatorics under the infinite sites model

CD Greenman, L Penso-Dolfin, T Wu - Journal of Theoretical Biology, 2020 - Elsevier
Rearrangements are discrete processes whereby discrete segments of DNA are deleted,
replicated and inserted into novel positions. A sequence of such configurations, termed a …

Maximum of the sum of consecutive terms in random permutations

L Glavaš, J Jocković, P Mladenović - Journal of Statistical Planning and …, 2018 - Elsevier
Maximum of the sum of consecutive terms in random permutations - ScienceDirect Skip to main
contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF Download …

[HTML][HTML] On groups generated by involutions of a semigroup

J East, TE Nordahl - Journal of Algebra, 2016 - Elsevier
An involution on a semigroup S (or any algebra with an underlying associative binary
operation) is a function α: S→ S that satisfies α (xy)= α (y) α (x) and α (α (x))= x for all x, y∈ S …

[HTML][HTML] A five-element transformation monoid on labelled trees

Y Wu, Z Xu, Y Zhu - European Journal of Combinatorics, 2019 - Elsevier
For each tree T on n vertices, a labelling of T is a bijective map from the vertex set of T to the
first n positive integers. We consider two maps, which send the labellings of T to labellings of …

Involution factorizations of Ewens random permutations

C Burnette - arXiv preprint arXiv:2105.12695, 2021 - arxiv.org
An involution is a bijection that is its own inverse. Given a permutation $\sigma $ of $[n], $ let
$\mathsf {invol}(\sigma) $ denote the number of ways $\sigma $ can be expressed as a …

Algebraic models of large scale genome rearrangement events

S Bhatia - Bulletin of the Australian Mathematical Society, 2019 - cambridge.org
Variations in genome arrangements are an important source of phylogenetic information
and have been used to inform phylogenetic studies since the 1930s. The arrangement of …