Sciweavers

13 search results - page 2 / 3
» Perfect DCJ Rearrangement
Sort
View
RECOMB
2010
Springer
13 years 3 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...
BMCBI
2010
120views more  BMCBI 2010»
13 years 5 months ago
Estimating true evolutionary distances under rearrangements, duplications, and losses
Background: The rapidly increasing availability of whole-genome sequences has enabled the study of whole-genome evolution. Evolutionary mechanisms based on genome rearrangements h...
Yu Lin, Vaibhav Rajan, Krister M. Swenson, Bernard...
WABI
2005
Springer
132views Bioinformatics» more  WABI 2005»
13 years 10 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...
CIBCB
2007
IEEE
13 years 11 months ago
An Experimental Evaluation of Inversion-and Transposition-Based Genomic Distances through Simulations
— Rearrangements of genes and other syntenic blocks have become a topic of intensive study by phylogenists, comparative genomicists, and computational biologists: they are a feat...
Moulik Kothari, Bernard M. E. Moret
CPM
1998
Springer
84views Combinatorics» more  CPM 1998»
13 years 9 months ago
Genome Halving
The Genome Halving Problem is motivated by the whole genome duplication events in molecular evolution that double the gene content of a genome and result in a perfect duplicated ge...
Nadia El-Mabrouk, Joseph H. Nadeau, David Sankoff