Sciweavers

RECOMB
2010
Springer
13 years 8 months ago
Ultra-Perfect Sorting Scenarios
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 definitio...
Aïda Ouangraoua, Anne Bergeron, Krister M. Sw...
WABI
2005
Springer
132views Bioinformatics» more  WABI 2005»
14 years 4 months ago
Perfect Sorting by Reversals Is Not Always Difficult
—We propose new algorithms for computing pairwise rearrangement scenarios that conserve the combinatorial structure of genomes. More precisely, we investigate the problem of sort...
Sèverine Bérard, Anne Bergeron, Cedr...
GECCO
2009
Springer
107views Optimization» more  GECCO 2009»
14 years 5 months ago
Swarming along the evolutionary branches sheds light on genome rearrangement scenarios
A genome rearrangement scenario describes a series of chromosome fusion, fission, and translocation operations that suffice to rewrite one genome into another. Exact algorithmic ...
Nikolay Vyahhi, Adrien Goëffon, Macha Nikolsk...