Evolutionary Puzzles: An Introduction to Genome Rearrangement

@inproceedings{Blanchette2001EvolutionaryPA,
  title={Evolutionary Puzzles: An Introduction to Genome Rearrangement},
  author={Mathieu Blanchette},
  booktitle={International Conference on Computational Science},
  year={2001}
}
  • M. Blanchette
  • Published in
    International Conference on…
    28 May 2001
  • Biology
This paper is intended to serve as an introduction to genome rearrangement and its use for inferring phylogenetic trees. We begin with a brief description of the major players of the field (chromosomes, genes, etc.) and the types of mutations that can affect them, focussing obviously on genome rearrangement. This leads to a simple mathematical representation of the data (the order of the genes on the chromosomes), and the operations that modify it (inversions, transpositions, and translocations… 
3 Citations
Algorithmic approaches for genome rearrangement: a review
TLDR
This paper covers many kinds of rearrangement events such as reversal, transposition, translocation, fussion, fission, and so on and a variety of mathematic models are included.
Revisiting the landscape of evolutionary breakpoints across human genome using multi-way comparison
TLDR
An approach to identify synteny blocks and evolutionary breakpoints based on UCSC 45-way conservation sequence alignments with 12 selected species will help to gain better insight into several studies including developmental studies and cancer rearrangement processes.
The double cut and join operation and its applications to genome rearrangements
Das Ziel dieser Arbeit sind mathematische Modelle fur den Genomvergleich, um die evolutionare Distanz zwischen zwei gegebenen Genomen zu schatzen. Wir prasentieren ein neues Modell fur den

References

SHOWING 1-10 OF 14 REFERENCES
Sorting by Transpositions
TLDR
The paper addresses the problem of genome comparison versus classical gene comparison and presents algorithms to analyze rearrangements in genomes evolving by transpositions and derive lower bounds on {\em transposition distance} between permutations and present approximation algorithms for sorting byTranspositions.
Gene order comparisons for phylogenetic inference: evolution of the mitochondrial genome.
TLDR
This work describes the construction of a database of 16 mitochondrial gene orders from fungi and other eukaryotes by using complete or nearly complete genomic sequences, and proposes a measure of gene order rearrangement based on the minimal set of chromosomal inversions, transpositions, insertions, and deletions necessary to convert the order in one genome to that of the other.
Sorting by Reversals: Genome Rearrangements in Plant Organelles and Evolutionary History of X Chromosome
TLDR
The paper addresses the problem of genome comparison versus classical gene comparison and presents algorithms to analyze rearrangements in genomes evolving by inversions and discusses applications of these algorithms in molecular evolution.
Parametric genome rearrangement.
The chromosome inversion problem
Multiple Genome Rearrangement and Breakpoint Phylogeny
TLDR
This paper shows which formulations of multiple alignment have counterparts in multiple rearrangement, and proposes a branch-and-bound solution to TSP particularly suited to instances of the Travelling Salesman Problem.
A New Fast Heuristic for Computing the Breakpoint Phylogeny and Experimental Phylogenetic Analyses of Real and Synthetic Data
TLDR
The preliminary results indicate that, on datasets with slow evolutionary rates and large numbers of genes in comparison with the number of taxa (genomes), all methods recover quite accurate reconstructions of the true evolutionary history (although BPAnalysis is too slow to be practical), but that on datasets where the rate of evolution is high relative to the numberof genes, the accuracy of all three methods is poor.
Transforming men into mice (polynomial algorithm for genomic distance problem)
TLDR
A duality theorem is proved which expresses the genomic distance in terms of easily computable parameters reflecting different combinatorial properties of sets of strings and leads to a polynomial time algorithm for computing most parsimonious rearrangement scenarios for human-mouse evolution.
Gene Order Breakpoint Evidence in Animal Mitochondrial Phylogeny
TLDR
The notion of unambiguously reconstructed segments is introduced as a way of extracting the invariant aspects of multiple solutions for a given ancestral genome; this enables a detailed reconstruction of the evolution of non-tRNA mitochondrial gene order.
The median problems for breakpoints are NP-complete
TLDR
It is shown that the median problem for breakpoints is already NP-hard for three permutations, and that this result holds both for signed and for unsigned permutations.
...
...