Sciweavers

28 search results - page 1 / 6
» Genome Rearrangement: A Planning Approach
Sort
View
AAAI
2010
13 years 6 months ago
Genome Rearrangement: A Planning Approach
Evolutionary trees of species can be reconstructed by pairwise comparison of their entire genomes. Such a comparison can be quantified by determining the number of events that cha...
Tansel Uras, Esra Erdem
AIPS
2010
13 years 3 months ago
Genome Rearrangement and Planning: Revisited
Evolutionary trees of species can be reconstructed by pairwise comparison of their entire genomes. Such a comparison can be quantified by determining the number of events that ch...
Tansel Uras, Esra Erdem
JDA
2007
156views more  JDA 2007»
13 years 4 months ago
A linear time algorithm for the inversion median problem in circular bacterial genomes
In the median problem, we are given a distance or dissimilarity measure d, three genomes G1, G2, and G3, and we want to find a genome G (a median) such that the sum 3 i=1 d(G, Gi...
Enno Ohlebusch, Mohamed Ibrahim Abouelhoda, Kathri...
RECOMB
2008
Springer
14 years 5 months ago
On Computing the Breakpoint Reuse Rate in Rearrangement Scenarios
In the past years, many combinatorial arguments have been made to support the theory that mammalian genome rearrangement scenarios rely heavily on breakpoint reuse. Different model...
Anne Bergeron, Julia Mixtacki, Jens Stoye
TCS
2008
13 years 4 months ago
A small trip in the untranquil world of genomes: A survey on the detection and analysis of genome rearrangement breakpoints
Genomes are dynamic molecules that are constantly undergoing mutations and rearrangements. The latter are large scale changes in a genome organisation that participate in the evol...
Claire Lemaitre, Marie-France Sagot