Sciweavers

36 search results - page 1 / 8
» Gene Maps Linearization Using Genomic Rearrangement Distance...
Sort
View
JCB
2007
58views more  JCB 2007»
13 years 10 months ago
Gene Maps Linearization Using Genomic Rearrangement Distances
Guillaume Blin, Eric Blais, Danny Hermelin, Pierre...
JDA
2007
156views more  JDA 2007»
13 years 10 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...
JCB
2008
144views more  JCB 2008»
13 years 10 months ago
Multi-Break Rearrangements and Breakpoint Re-Uses: From Circular to Linear Genomes
Multi-break rearrangements break a genome into multiple fragments and further glue them together in a new order. While 2-break rearrangements represent standard reversals, fusions...
Max A. Alekseyev
RECOMB
2007
Springer
14 years 11 months ago
Multi-break Rearrangements: From Circular to Linear Genomes
Multi-break rearrangements break a genome into multiple fragments and further glue them together in a new order. While 2break rearrangements represent standard reversals, fusions, ...
Max A. Alekseyev
RECOMB
2006
Springer
14 years 11 months ago
Inferring Gene Orders from Gene Maps Using the Breakpoint Distance
Abstract. Preliminary to most comparative genomics studies is the annotation of chromosomes as ordered sequences of genes. Unfortunately, different genetic mapping techniques usual...
Guillaume Blin, Eric Blais, Pierre Guillon, Mathie...