中文
相关论文

相关论文: Expected number of inversions after a sequence of …

200 篇论文

Genome rearrangements are evolutionary events that shuffle genomic architectures. Most frequent genome rearrangements are reversals, translocations, fusions, and fissions. While there are some more complex genome rearrangements such as…

基因组学 · 定量生物学 2015-04-07 Nikita Alexeev , Rustem Aidagulov , Max A. Alekseyev

We give a new expression for the expected number of inversions in the product of n random adjacent transpositions in the symmetric group S_{m+1}. We then derive from this expression the asymptotic behaviour of this number when n scales with…

组合数学 · 数学 2025-09-26 Mireille Bousquet-Mélou

Some genes can change their relative locations in a genome. Thus for different individuals of the same species, the orders of genes might be different. Such jumping genes are called transposons. A practical problem is to determine…

基因组学 · 定量生物学 2022-09-02 Yue Wang

Motivation: Genome rearrangement plays an important role in evolutionary biology and has profound impacts on phenotype in organisms ranging from microbes to humans. The mechanisms for genome rearrangement events remain unclear. Lots of…

基因组学 · 定量生物学 2016-08-09 Dan Wang , Shuaicheng Li , Fei Guo , Lusheng Wang

Inversions, also sometimes called reversals, are a major contributor to variation among bacterial genomes, with studies suggesting that those involving small numbers of regions are more likely than larger inversions. Deletions may arise in…

环与代数 · 数学 2023-07-11 Chad Clark , Julius Jonušas , James D. Mitchell , Andrew Francis

Early literature on genome rearrangement modelling views the problem of computing evolutionary distances as an inherently combinatorial one. In particular, attention was given to estimating distances using the minimum number of events…

种群与进化 · 定量生物学 2023-01-12 Joshua Stevenson , Venta Terauds , Jeremy Sumner

We present a simple formula for the expected number of inversions in a permutation of size $n$ obtained by applying $t$ random (not necessarily adjacent) transpositions to the identity permutation. More general, for any finite irreducible…

组合数学 · 数学 2010-11-25 Jonas Sjostrand

Normal approximations for descents and inversions of permutations of the set $\{1,2,...,n\}$ are well known. A number of sequences that occur in practice, such as the human genome and other genomes, contain many repeated elements. Motivated…

概率论 · 数学 2014-08-28 Mark Conger , D. Viswanath

Genome rearrangement distances are an established method in genome comparison. Works in this area may include various rearrangement operations representing large-scale mutations, gene orientation information, the number of nucleotides in…

数据结构与算法 · 计算机科学 2026-01-01 Gabriel Siqueira , Alexsandro Oliveira Alexandrino , Zanoni Dias

Genomic distance between two genomes, i.e., the smallest number of genome rearrangements required to transform one genome into the other, is often used as a measure of evolutionary closeness of the genomes in comparative genomics studies.…

基因组学 · 定量生物学 2011-03-30 Shuai Jiang , Max A. Alekseyev

During the course of evolution, an organism's genome can undergo changes that affect the large-scale structure of the genome. These changes include gene gain, loss, duplication, chromosome fusion, fission, and rearrangement. When gene gain…

基因组学 · 定量生物学 2012-07-31 Birte Kehr , Knut Reinert , Aaron E. Darling

Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion…

离散数学 · 计算机科学 2024-06-25 Atli Fannar Franklín , Anders Claesson , Christian Bean , Henning Úlfarsson , Jay Pantone

Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion…

组合数学 · 数学 2025-05-28 Atli Fannar Franklín

This paper proposes a new algorithm for generating all permutations of multisets. The method uses transpositions only and adjacent transpositions are favoured. The algorithm requires a strong homogeneous transposition condition:…

组合数学 · 数学 2023-09-22 Hans Jakob Rivertz

Motivated by applications in mathematical biology concerning randomly alternating motion of micro-organisms, we analyze a generalized integrated telegraph process. The random times between consecutive velocity reversals are…

概率论 · 数学 2008-03-10 Antonio Di Crescenzo , Barbara Martinucci

Gene conversion is a mechanism by which a double-strand break in a DNA molecule is repaired using a homologous DNA molecule as a template. As a result, one gene is 'copied and pasted' onto the other gene. It was recently reported that the…

种群与进化 · 定量生物学 2013-04-08 Shuhei Mano

Gene tree/species tree reconciliation is a recent decisive progress in phylo-genetic methods, accounting for the possible differences between gene histories and species histories. Reconciliation consists in explaining these differences by…

定量方法 · 定量生物学 2017-10-05 Damir Hasic , Eric Tannier

Background. Models of ancestral gene order reconstruction have progressively integrated different evolutionary patterns and processes such as unequal gene content, gene duplications, and implicitly sequence evolution via reconciled gene…

种群与进化 · 定量生物学 2013-07-01 Murray Patterson , Gergely J Szöllősi , Vincent Daubin , Eric Tannier

Understanding the dynamics of genome rearrangements is a major issue of phylogenetics. Phylogenetics is the study of species evolution. A major goal of the field is to establish evolutionary relationships within groups of species, in order…

数据结构与算法 · 计算机科学 2014-10-22 Antoine Thomas

In the context of the genome rearrangement problem, we analyze two well known models, namely the block transposition and the prefix block transposition models, by exploiting the connection with the notion of permutation pattern. More…

组合数学 · 数学 2018-08-09 Giulio Cerbai , Luca Ferrari
‹ 上一页 1 2 3 10 下一页 ›