Sciweavers

12 search results - page 2 / 3
» Multi-break Rearrangements: From Circular to Linear Genomes
Sort
View
RECOMB
2009
Springer
14 years 3 days ago
Counting All DCJ Sorting Scenarios
In genome rearrangements, the double cut and join (DCJ) operation, introduced by Yancopoulos et al., allows to represent most rearrangement events that could happen in multichromos...
Marília D. V. Braga, Jens Stoye
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...
COCOON
2005
Springer
13 years 11 months ago
Genome Rearrangements with Partially Ordered Chromosomes
Genomic maps often do not specify the order within some groups of two or more markers. The synthesis of a master map from several sources introduces additional order ambiguity due ...
Chunfang Zheng, David Sankoff
FSTTCS
2003
Springer
13 years 10 months ago
Comparing Sequences with Segment Rearrangements
Computational genomics involves comparing sequences based on “similarity” for detecting evolutionary and functional relationships. Until very recently, available portions of th...
Funda Ergün, S. Muthukrishnan, Süleyman ...
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...