Estimating the expected reversal distance after a fixed number of reversals

DOI10.1016/S0196-8858(03)00054-XzbMath1051.92029MaRDI QIDQ1883401

Niklas Eriksen, Axel Hultman

Publication date: 12 October 2004

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Permutations; Genome rearrangements; Sorting by reversals; Transpositions; Expected distances

Mathematics Subject Classification ID

60J20: Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.)

92C40: Biochemistry, molecular biology

92D20: Protein sequences, DNA sequences

92D10: Genetics and epigenetics

Related Items

A representation-theoretic approach to the calculation of evolutionary distance in bacteria, The probability of long cycles in interchange processes, Random induced subgraphs of Cayley graphs induced by transpositions, Expected number of breakpoints after \(t\) random reversals in genomes with duplicate genes, Measures for the exceptionality of gene order in conserved genomic regions, Reversal and transposition medians, Maximum likelihood estimates of rearrangement distance: implementing a representation-theoretic approach, Maximum likelihood estimates of pairwise rearrangement distances, Permutation statistics of products of random permutations, Expected number of inversions after a sequence of random adjacent transpositions -- an exact expression, Expected length of a product of random reflections, Comparative Genomics on Artificial Life

Cites Work

• On the tightness of the alternating-cycle lower bound for sorting by reversals
• Expected reflection distance in \(G(r,1,n)\) after a fixed number of reflections
• Transforming cabbage into turnip
• Genome Rearrangements and Sorting by Reversals
• Estimating true evolutionary distances between genomes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item