Estimating the expected reversal distance after a fixed number of reversals
From MaRDI portal
Publication:1883401
DOI10.1016/S0196-8858(03)00054-XzbMath1051.92029MaRDI QIDQ1883401
Publication date: 12 October 2004
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20) Genetics and epigenetics (92D10)
Related Items (12)
Comparative Genomics on Artificial Life ⋮ The probability of long cycles in interchange processes ⋮ Maximum likelihood estimates of pairwise rearrangement distances ⋮ Random induced subgraphs of Cayley graphs induced by transpositions ⋮ A representation-theoretic approach to the calculation of evolutionary distance in bacteria ⋮ Permutation statistics of products of random permutations ⋮ Maximum likelihood estimates of rearrangement distance: implementing a representation-theoretic approach ⋮ 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 ⋮ Expected length of a product of random reflections ⋮ Expected number of inversions after a sequence of random adjacent transpositions -- an exact expression
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
This page was built for publication: Estimating the expected reversal distance after a fixed number of reversals
