Early eukaryote evolution based on mitochondrial gene order breakpoints

Authors:
David Sankoff;David Bryant;Mélanie Deneault;B. Franz Lang;Gertraud Burger
Affiliations:
Centre de recherches mathématiques, Université de Montréal, CP 6128 succursale Centre-ville, Montréal, Québec H3C 3J7;Centre de recherches mathématiques, Université de Montréal, CP 6128 succursale Centre-ville, Montréal, Québec H3C 3J7;Centre de recherches mathématiques, Université de Montréal, CP 6128 succursale Centre-ville, Montréal, Québec H3C 3J7;Département de biochimie, Université de Montréal, CP 6128, succursale Centre-ville, Montréal, Québec H3C 3J7;Département de biochimie, Université de Montréal, CP 6128, succursale Centre-ville, Montréal, Québec H3C 3J7
Venue:
RECOMB '00 Proceedings of the fourth annual international conference on Computational molecular biology
Year:
2000

Citing 4
Cited 2

Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Formulations and hardness of multiple sorting by reversals

RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Edit Distances for Genome Comparisons Based on Non-Local Operations

CPM '92 Proceedings of the Third Annual Symposium on Combinatorial Pattern Matching
The Median Problem for Breakpoints in Comparative Genomics

COCOON '97 Proceedings of the Third Annual International Conference on Computing and Combinatorics

Reconstructing an ancestral genome using minimum segments duplications and reversals

Journal of Computer and System Sciences - Computational biology 2002
A Lower Bound for the Breakpoint Phylogeny Problem

COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a general heuristic for the median problem for induced breakpoints on genomes with unequal gene content and incorporate this into a routine for estimating optimal gene orders for the ancestral genomes in a fixed phylogeny. The routine is applied to a phylogenetic study of an up-to-date set of completely sequenced protist mitochondrial genomes, confirming some of the recent sequence-based groupings which have been proposed and, conversely, confirming the usefulness of the breakpoint method as a phylogenetic tool even for small genomes.