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

Authors:
Niklas Eriksen
Affiliations:
Mathematical Sciences, Göteborg University and Chalmers University of Technology, S-412 96 Göteborg, Sweden
Venue:
Discrete Applied Mathematics
Year:
2008

Citing 11
Cited 0

Sorting by Transpositions

SIAM Journal on Discrete Mathematics
A 2-approximation algorithm for genome rearrangements by reversals and transpositions

Theoretical Computer Science - Special issue: Genome informatics
Probability models for genome rearrangement and linear invariants for phylogenetic inference

RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals

Journal of the ACM (JACM)
Sorting Permutations by Reversals and Eulerian Cycle Decompositions

SIAM Journal on Discrete Mathematics
Estimating true evolutionary distances between genomes

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
(1 + ɛ)-Approximation of sorting by reversals and transpositions

Theoretical Computer Science
Approximating the Expected Number of Inversions Given the Number of Breakpoints

WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
Assignment of Orthologous Genes via Genome Rearrangement

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
An experimental metagenome data management and analysis system

Bioinformatics
A 1.375-Approximation Algorithm for Sorting by Transpositions

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)

Quantified Score

Hi-index	0.04

Visualization

Abstract

In comparative genomics, one wishes to deduce the evolutionary distance between different species by studying their genomes. Using gene order information, we seek the number of times the gene order has changed between two species. One approach is to compute the method of moments estimate of this edit distance from a measure of dissimilarity called the breakpoint measure. In this paper, we extend the formulae and bounds of this estimate on gene permutations to genomes with duplicate genes.