Multi-break rearrangements: from circular to linear genomes

Authors:
Max A. Alekseyev
Affiliations:
Department of Computer Science and Engineering, University of California at San Diego
Venue:
RECOMB-CG'07 Proceedings of the 2007 international conference on Comparative genomics
Year:
2007

Citing 15
Cited 1

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
Signed genome rearrangement by reversals and transpositions: models and approximations

Theoretical Computer Science
Genome Rearrangements and Sorting by Reversals

SIAM Journal on Computing
Efficient algorithms for multichromosomal genome rearrangements

Journal of Computer and System Sciences - Computational biology 2002
Transforming men into mice (polynomial algorithm for genomic distance problem)

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Chromosomal breakpoint re-use in the inference of genome sequence rearrangement

RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
Reversals and Transpositions Over Finite Alphabets

SIAM Journal on Discrete Mathematics
Efficient sorting of genomic permutations by translocation, inversion and block interchange

Bioinformatics
Whole genome duplications, multi-break rearrangements, and genome halving problem

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Multi-break rearrangements and chromosomal evolution

Theoretical Computer Science
A simpler 1.5-approximation algorithm for sorting by transpositions

CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Working on the problem of sorting by transpositions on genome rearrangements

CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
A 1.375-approximation algorithm for sorting by transpositions

WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
Sorting by weighted reversals, transpositions, and inverted transpositions

RECOMB'06 Proceedings of the 10th annual international conference on Research in Computational Molecular Biology

Multi-break rearrangements and chromosomal evolution

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multi-break rearrangements break a genome into multiple fragments and further glue them together in a new order. While 2- break rearrangements represent standard reversals, fusions, fissions, and translocations operations; 3-break rearrangements are a natural generalization of transpositions and inverted transpositions. Multi-break rearrangements in circular genomes were studied in depth in [1] and were further applied to the analysis of chromosomal evolution in mammalian genomes [2]. In this paper we extend these results to the more difficult case of linear genomes. In particular, we give lower bounds for the rearrangement distance between linear genomes and use these results to analyze comparative genomic architecture of mammalian genomes.