Conservation of combinatorial structures in evolution scenarios

Authors:
Sèverine Bérard;Anne Bergeron;Cedric Chauve
Affiliations:
LIRMM, Montpellier, France;LaCIM, Université du Québec à Montréal, Canada;LaCIM, Université du Québec à Montréal, Canada
Venue:
RCG'04 Proceedings of the 2004 RECOMB international conference on Comparative Genomics
Year:
2004

Citing 6
Cited 11

Formulations and hardness of multiple sorting by reversals

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)
A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals

SIAM Journal on Computing
Inversion Medians Outperform Breakpoint Medians in Phylogeny Reconstruction from Gene-Order Data

WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
Finding All Common Intervals of k Permutations

CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
A Very Elementary Presentation of the Hannenhalli-Pevzner Theory

CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching

Perfect Sorting by Reversals Is Not Always Difficult

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

RECOMB-CG '08 Proceedings of the international workshop on Comparative Genomics
Solving the Preserving Reversal Median Problem

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Exploring the Solution Space of Sorting by Reversals, with Experiments and an Application to Evolution

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Average-Case Analysis of Perfect Sorting by Reversals

CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
A fast and exact algorithm for the perfect reversal median problem

ISBRA'07 Proceedings of the 3rd international conference on Bioinformatics research and applications
Ultra-perfect sorting scenarios

RECOMB-CG'10 Proceedings of the 2010 international conference on Comparative genomics
A parallel algorithm for solving the reversal median problem

PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Computing common intervals of K permutations, with applications to modular decomposition of graphs

ESA'05 Proceedings of the 13th annual European conference on Algorithms
Common intervals and symmetric difference in a model-free phylogenomics, with an application to streptophyte evolution

RCG'06 Proceedings of the RECOMB 2006 international conference on Comparative Genomics
Inferring gene orders from gene maps using the breakpoint distance

RCG'06 Proceedings of the RECOMB 2006 international conference on Comparative Genomics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates the problem of conservation of combinatorial structures in genome rearrangement scenarios. We give a characterization of a class of scenarios that conserve all common intervals, called commuting scenarios, and a characterization of permutations for which commuting scenarios exist. We show that measuring conservation of common intervals can be useful tool in assessing the quality of rearrangement scenarios, by investigating in detail three specific scenarios involving the mouse, rat and human X chromosomes.