Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

RECOMB
2010
Springer

favoriteEmaildiscussreport

124views Computational Biology» more RECOMB 2010»

Ultra-Perfect Sorting Scenarios

13 years 2 months ago

Ultra-Perfect Sorting Scenarios

Download albuquerque.bioinformatics.uottawa.ca

Abstract. Perfection has been used as a criteria to select rearrangement scenarios since 2004. However, there is a fundamental bias towards extant species in the original definition: ancestral species are not bound to perfection. Here we develop a new theory of perfection that takes an egalitarian view of species, and apply it to the complex evolution of mammal chromosome X.

Aïda Ouangraoua, Anne Bergeron, Krister M. Sw

Real-time Traffic

Computational Biology | Extant Species | Perfection | Rearrangement Scenarios | RECOMB 2010 |

claim paper

Related Content

» Counting All DCJ Sorting Scenarios

» Perfect Sorting by Reversals Is Not Always Difficult

» Perfect Sorting by Reversals

» Advances on sorting by reversals

» TagSorting A Tagging Environment for Collaboratively Building Ontologies

» What Sort of Control System Is Able to Have a Personality

» Lower bounds for sorting with few random accesses to external memory

» Transforming cabbage into turnip polynomial algorithm for sorting signed permutations by r...

» Sorting by Reversals in Subquadratic Time

Post Info
More Details (n/a)

Added	14 Feb 2011
Updated	14 Feb 2011
Type	Journal
Year	2010
Where	RECOMB
Authors	Aïda Ouangraoua, Anne Bergeron, Krister M. Swenson

Comments (0)