Expected number of breakpoints after \(t\) random reversals in genomes with duplicate genes

DOI10.1016/j.dam.2007.10.023zbMath1144.92326OpenAlexW2024553809MaRDI QIDQ947117

Niklas Eriksen

Publication date: 29 September 2008

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

Full work available at URL: https://doi.org/10.1016/j.dam.2007.10.023

zbMATH Keywords

genomic distanceexpected distancemethod of moments estimate

Mathematics Subject Classification ID

Applications of statistics to biology and medical sciences; meta analysis (62P10) Problems related to evolution (92D15) Enumerative combinatorics (05A99)

Related Items (1)

Equidistributed statistics on matchings and permutations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A 2-approximation algorithm for genome rearrangements by reversals and transpositions
• \((1+\varepsilon)\)-approximation of sorting by reversals and transpositions.
• Estimating the expected reversal distance after a fixed number of reversals
• Transforming cabbage into turnip
• Sorting Permutations by Reversals and Eulerian Cycle Decompositions
• Sorting by Transpositions
• Exact-IEBP: A New Technique for Estimating Evolutionary Distances between Whole Genomes
• Estimating true evolutionary distances between genomes

This page was built for publication: Expected number of breakpoints after \(t\) random reversals in genomes with duplicate genes